Roman Sot'ak

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.CO2025

Normal 6-edge-colorings of cubic graphs with oddness 2

Igor Fabrici, Borut Lužar, Roman Soták +1

A normal edge-coloring of a cubic graph is a proper edge-coloring, in which every edge is adjacent to edges colored with four distinct colors or to edges colored with two distinct…