Coloring of Plane Graphs with Unique Maximal Colors on Faces

DOI10.1002/jgt.22002zbMath1352.05073arXiv1409.2250OpenAlexW2228680997MaRDI QIDQ2833253

Alex Wendland

Publication date: 17 November 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

plane graphscapital \(k\)-choosabilitycapital graph coloring

Mathematics Subject Classification ID

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

Related Items (7)

Facially-constrained colorings of plane graphs: a survey ⋮ Facial unique-maximum edge and total coloring of plane graphs ⋮ On facial unique-maximum (edge-)coloring ⋮ A counterexample to a conjecture on facial unique-maximal colorings ⋮ A survey on the cyclic coloring and its relaxations ⋮ Facial unique-maximum colorings of plane graphs with restriction on big vertices ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods

Cites Work

• Unnamed Item
• List colourings of planar graphs
• Every planar graph is 5-choosable

This page was built for publication: Coloring of Plane Graphs with Unique Maximal Colors on Faces