12 citations · 22 across the 3 of their papers we have counts for
3 papers
math.CO2021★ 12 cited
Strong edge colorings of graphs and the covers of Kneser graphs
Borut Lužar, Edita Mačajová, Martin Škoviera +1
A proper edge coloring of a graph is strong if it creates no bichromatic path of length three. It is well known that for a strong edge coloring of a -regular graph at least $2k-…
math.CO2019★ 10 cited
Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs
Igor Fabrici, Jochen Harant, Tomáš Madaras +3
A graph is -planar if it has a drawing in the plane such that each edge is crossed at most once by another edge. Moreover, if this drawing has the additional property that for e…
math.CO2013
Strong edge coloring of subcubic bipartite graphs
Borut Lužar, Martina Mockovčiaková, Roman Soták +1
A strong edge coloring of a graph is a proper edge coloring in which each color class is an induced matching of . In 1993, Brualdi and Quinn Massey proposed a conjecture tha…