-facial edge colorings of graphs

From MaRDI portal
Publication:479043

DOI10.1016/J.DAM.2014.10.009zbMATH Open1304.05050arXiv1303.4346OpenAlexW2034174803MaRDI QIDQ479043FDOQ479043


Authors: Borut Lužar, Martina Mockovčiaková, Roman Soták, Riste Škrekovski, Peter Šugerek Edit this on Wikidata


Publication date: 5 December 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Abstract: 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 conjectured that 3l + 1 colors suffice for an l-facial edge coloring of any plane graph. We prove that 7 colors suffice for a 2-facial edge coloring of any plane graph and therefore confirm the conjecture for l = 2.


Full work available at URL: https://arxiv.org/abs/1303.4346




Recommendations




Cites Work


Cited In (19)





This page was built for publication: \(\ell\)-facial edge colorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479043)