Petra Melicharová

collaborators

3 papers

math.CO2026

Frugal coloring in planar graphs with maximum degree 4 and 5

Boštjan Brešar, Přemysl Holub, Marko Jakovac +1

A proper coloring of vertices of a graph $G$ is called $t$ -frugal if no color appears more than $t$ times in the neighborhood of any vertex of $G$ . While $1$ -frugal coloring coinci…

math.CO2026

On $S$ -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 $S$ -packing total coloring. For a graph $G$ and a non-decreasing sequence…

math.CO2024

$S$ -packing colorings of distance graphs with distance sets of cardinality $2$

Boštjan Brešar, Jasmina Ferme, Přemysl Holub +2

For a non-decreasing sequence $S = (s_{1}, s_{2}, \dots)$ of positive integers, a partition of the vertex set of a graph $G$ into subsets $X_{1}, \dots, X_{ℓ}$ , such that vertices in $X_{i}$ …

Frugal coloring in planar graphs with maximum degree 4 and 5

On S-packing total colorings

S-packing colorings of distance graphs with distance sets of cardinality 2

On $S$ -packing total colorings

$S$ -packing colorings of distance graphs with distance sets of cardinality $2$