9 papers · 1 filter
On -packing total colorings
Jasmina Ferme, Jaka Hedžet, Petra Melicharova +1
In this paper, we generalize the concept of packing total coloring by introducing a new concept called the -packing total coloring. For a graph and a non-decreasing sequence…
On packing total coloring
Jasmina Ferme, Daša Mesarič Štesl
In this paper, we introduce a new concept in graph coloring, namely the \textit{packing total coloring}, which extends the idea of packing coloring to both the vertices and the edg…
-packing colorings of distance graphs with distance sets of cardinality
Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2
For a non-decreasing sequence of positive integers, a partition of the vertex set of a graph into subsets , such that vertices in …
A characterization of --(vertex-)critical graphs
Jasmina Ferme
Given a graph , a function with the property that implies that the distance between and is greater than , is call…
-packing colorings of distance graphs
Boštjan Brešar, Jasmina Ferme, Karolína Kamenická
Given a graph and a non-decreasing sequence of positive integers, the mapping is an -packing -coloring of if…
Packing chromatic numbers of finite super subdivisions of graphs
Rachid Lemdani, Moncef Abbas, Jasmina Ferme
The \textit{packing chromatic number} of a graph , denoted by , is the smallest integer such that the vertex set of can be partitioned into sets , $i\in \…