15 citations · 57 across the 24 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
math.CO2014
Planar digraphs of digirth five are 2-colorable
Ararat Harutyunyan, Bojan Mohar
Neumann-Lara (1985) and Škrekovski conjectured that every planar digraph with digirth at least three is 2-colorable. We prove a relaxed version of this conjecture: every planar dig…
cs.DM2014
Strong edge-colouring of sparse planar graphs
Julien Bensmail, Ararat Harutyunyan, Hervé Hocquard +1
A strong edge-colouring of a graph is a proper edge-colouring where each colour class induces a matching. It is known that every planar graph with maximum degree has a strong e…