Facial unique-maximum colorings of plane graphs with restriction on big vertices

DOI10.1016/j.disc.2019.05.029zbMath1416.05112arXiv1806.07432OpenAlexW2955604276WikidataQ127750734 ScholiaQ127750734MaRDI QIDQ2312801

Riste Škrekovski, Bernard Lidický, Kacy Messerschmidt

Publication date: 18 July 2019

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

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

zbMATH Keywords

plane graphfacial unique-maximum coloring

Mathematics Subject Classification ID

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

Related Items (2)

Facial unique-maximum edge and total coloring of plane graphs ⋮ A survey on the cyclic coloring and its relaxations

Cites Work

• 5-choosability of graphs with crossings far apart
• Unique-maximum coloring of plane graphs
• Every planar graph is 5-choosable
• On facial unique-maximum (edge-)coloring
• A counterexample to a conjecture on facial unique-maximal colorings
• 3-list-coloring planar graphs of girth 5
• Coloring of Plane Graphs with Unique Maximal Colors on Faces
• 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles

This page was built for publication: Facial unique-maximum colorings of plane graphs with restriction on big vertices