7 citations · 17 across the 16 of their papers we have counts for
5 papers · 1 filter
On two extensions of equimatchable graphs
Zakir Deniz, Tınaz Ekim, Tatiana Romina Hartinger +2
A graph is said to be equimatchable if all its maximal matchings are of the same size. In this work we introduce two extensions of the property of equimatchability by defining two…
Edge Coloring with Minimum Reload/Changeover Costs
Didem Gözüpek, Mordechai Shalom
In an edge-colored graph, a traversal cost occurs at a vertex along a path when consecutive edges with different colors are traversed. The value of the traversal cost depends only…
Equimatchable Claw-Free Graphs
Saieed Akbari, Hadi Alizadeh, Tınaz Ekim +2
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to t…
A Simple Extension of Dirac's Theorem on Hamiltonicity
Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan +1
The classical Dirac theorem asserts that every graph on vertices with minimum degree is Hamiltonian. The lower bound of on…
Parameterized complexity of the MINCCA problem on graphs of bounded decomposability
Didem Gözüpek, Sibel Özkan, Christophe Paul +2
In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The "Minimum Chan…