42 citations · 65 across the 6 of their papers we have counts for
6 papers
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…
Star Edge-Coloring of Square Grids
Přemysl Holub, Borut Lužar, Erika Mihaliková +2
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer such that admits a star edge-coloring…
On non-repetitive sequences of arithmetic progressions:the cases
Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2
A -subsequence of a sequence is a subsequence , for any positive integer and any , . A \textit{-Thue seque…
Note on list star edge-coloring of subcubic graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták
{\emph A star edge-coloring} of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring…
Star edge coloring of some classes of graphs
Ľudmila Bezegová, Borut Lužar, Martina Mockovčiaková +2
\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and…
l-facial edge colorings of graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták +2
An l-facial edge coloring of a plane graph is a coloring of the edges such that any two edges at distance at most l on a boundary walk of some face receive distinct colors. It is c…