14 citations · 14 across the 7 of their papers we have counts for
7 papers
Packing coloring of graphs with long paths
Hanna Furmańczyk, Didem Gözüpek, Sibel Özkan
The packing coloring problem has diverse applications, including frequency assignment in wireless networks, resource distribution and facility location in smart cities and post-dis…
The Directed Uniform Hamilton-Waterloo Problem Involving Even Cycle Sizes
Fatih Yetgin, Uğur Odabaşı, Sibel Özkan
In this paper, factorizations of the complete symmetric digraph into uniform factors consisting of directed even cycle factors are studied as a generalization of the undire…
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…
On the Hamilton-Waterloo Problem with triangle factors and -factors
John Asplund, David Kamin, Melissa Keranen +2
The Hamilton-Waterloo Problem (HWP) in the case of -factors and -factors asks if , where is odd (or , where is a 1-factor and is even), can be…
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…