Facial incidence colorings of embedded multigraphs

DOI10.7151/dmgt.2050zbMath1401.05118OpenAlexW2792884661WikidataQ130158994 ScholiaQ130158994MaRDI QIDQ1630925

Mirko Horňák, Roman Soták, Stanlislav Jendroľ

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2050

zbMATH Keywords

incidenceembedded multigraphfacial incidence coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Invalid proofs on incidence coloring
• Some results on the incidence coloring number of a graph
• Incidence and strong edge colorings of graphs
• On incidence coloring and star arboricity of graphs
• The four-colour theorem
• On incidence coloring for some cubic graphs
• The incidence coloring conjecture for graphs of maximum degree 3
• The star arboricity of graphs
• Incidence coloring of \(k\)-degenerated graphs
• Incidence coloring of regular graphs and complement graphs
• Unique-maximum edge-colouring of plane graphs with respect to faces
• NP-completeness of 4-incidence colorability of semi-cubic graphs
• 2-Distance Coloring of Sparse Graphs
• On the linear vertex-arboricity of a planar graph
• Every Planar Map is Four Colorable
• Labeling Planar Graphs with Conditions on Girth and Distance Two
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths
• Acyclic colorings of planar graphs

This page was built for publication: Facial incidence colorings of embedded multigraphs