Didem Gozupek

collaborators

4 papers

math.CO2026

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…

math.CO2026

S-packing chromatic critical paths and cycles

GÃ¼lnaz BoruzanlÄ± Ekinci, Csilla BujtÃ¡s, Didem GÃ¶zÃ¼pek +1

Let $S = (s_{1}, s_{2}, \dots)$ be a non-decreasing sequence of positive integers. For a graph $G$ with vertex set $V (G)$ , a labeling $I ¨ : V (G) \to {1, \dots, k}$ is an $S$ -packing $…

math.CO2025

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…

math.CO2025

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 $S = (s_{1}, s_{2}, \dots)$ , the $S$ -packing chromatic number of a graph $G$ is denoted by $I ¨ _{S} (G)$ . In this paper, $I ¨ _{S}$ -critical gra…