4 papers
On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes
Fatih Yetgin, Uğur Odabaşı, Sibel Özkan
The Directed Hamilton-Waterloo Problem asks for a directed -factorization of the complete symmetric digraph where there are two non-isomorphic -factors. In the unifor…
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…
The Hamilton-Waterloo Problem with and Factors
Uğur Odabaşı, Sibel Özkan
The Hamilton-Waterloo problem with uniform cycle sizes asks for a factorization of the complete graph (for odd {\em v}) or minus a factor (for even {\em v}) wh…