Diana Svecová

collaborators

2 papers

math.CO2025

Improper coloring of toroidal graphs

Alexandra Kolačkovská, Mária Maceková, Roman Soták +1

A graph $G$ is called $(d_{1}, \dots, d_{k})$ -colorable if its vertices can be partitioned into $k$ sets $V_{1}, \dots, V_{k}$ such that $Δ (⟨ V_{i} ⟩_{G}) \leq d_{i}, i \in {1, \dots, k}$ .…

math.CO2024

List strong and list normal edge-coloring of (sub)cubic graphs

Borut Lužar, Edita Máčajová, Roman Soták +1

A strong edge-coloring of a graph is a proper edge-coloring, in which the edges of every path of length 3 receive distinct colors; in other words, every pair of edges at distance a…