1 citations · 1 across the 5 of their papers we have counts for
5 papers
On the Packing Coloring Gap of Graphs
Batoul Tarhini, Didem Gözüpek
The packing chromatic number of a graph is the minimum number of colors for which the graph admits a packing coloring. This distance-based parameter may change under local structur…
S-packing chromatic critical paths and cycles
Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1
Let be a non-decreasing sequence of positive integers. For a graph with vertex set , a labeling is an -packing $k…
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…
S-packing chromatic critical graphs
Gülnaz Boruzanlı Ekinci, Csilla Bujtás, Didem Gözüpek +1
For a non-decreasing sequence of positive integers , the -packing chromatic number of a graph is denoted by . In this paper, -critical graph…
Total -Uniform Graphs
Selim Bahadır, Didem Gözüpek, Oğuz Doğan
A sequence of vertices in a graph without isolated vertices is called a total dominating sequence if every vertex in the sequence has a neighbor which is adjacent to no ver…