Showing 2016Show all
2 papers · 1 filter
cs.DM2016
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…
cs.DS2016
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…