5 citations · 5 across the 1 of their papers we have counts for
2 papers
math.CO2014★ 5 cited
Joins of 1-planar graphs
Július Czap, Dávid Hudák, Tomáš Madaras
A graph is called 1-planar if there exists its drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the joi…
math.CO2013
Strong edge coloring of planar graphs
Dávid Hudák, Borut Lužar, Roman Soták +1
A strong edge coloring of a graph is a proper edge coloring where the edges at distance at most two receive distinct colors. It is known that every planar graph with maximum degree…