7 citations · 9 across the 2 of their papers we have counts for
2 papers
math.CO2022★ 7 cited
Locally irregular edge-coloring of subcubic graphs
Borut Lužar, Mária Maceková, Simona Rindošová +3
A graph is {\em locally irregular} if no two adjacent vertices have the same degree. A {\em locally irregular edge-coloring} of a graph is such an (improper) edge-coloring that…
math.CO2018★ 2 cited
Note on 3-Choosability of Planar Graphs with Maximum Degree 4
François Dross, Borut Lužar, Mária Maceková +1
Deciding whether a planar graph (even of maximum degree ) is -colorable is NP-complete. Determining subclasses of planar graphs being -colorable has a long history, but si…