5 citations
2 papers
math.CO2023★ 2 cited
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…
math.CO2022★ 5 cited
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…