55 citations · 324 across the 27 of their papers we have counts for
27 papers
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…
Degree-balanced decompositions of cubic graphs
Borut Lužar, Jakub Przybyło, Roman Soták
We show that every cubic graph on vertices contains a spanning subgraph in which the number of vertices of each degree deviates from by at most , up…
Packing coloring of hypercubes with extended Hamming codes
Petr Gregor, Jaka Kranjc, Borut Lužar +1
A {\em packing coloring} of a graph is a mapping assigning a positive integer (a color) to every vertex of such that every two vertices of color are at distance at leas…
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…
Revisiting Semistrong Edge-Coloring of Graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták
A matching in a graph is {\em semistrong} if every edge of has an endvertex of degree one in the subgraph induced by the vertices of . A {\em semistrong edge-colorin…
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
Igor Fabrici, Borut Lužar, Simona Rindošová +1
A {\em conflict-free coloring} of a graph {\em with respect to open} (resp., {\em closed}) {\em neighborhood} is a coloring of vertices such that for every vertex there is a color…