Facial unique-maximum edge and total coloring of plane graphs

DOI10.1016/j.dam.2020.09.016zbMath1460.05061OpenAlexW3117383336MaRDI QIDQ2659070

Simona Rindošová, Mirko Horňák, Igor Fabrici

Publication date: 25 March 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.09.016

zbMATH Keywords

edge coloringplane graphtotal coloringfacial coloringunique-maximum coloring

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• 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
• Facial unique-maximum colorings of plane graphs with restriction on big vertices
• Unique-maximum edge-colouring of plane graphs with respect to faces
• Facially-constrained colorings of plane graphs: a survey
• Facial list colourings of plane graphs
• Coloring of Plane Graphs with Unique Maximal Colors on Faces
• Colouring vertices of plane graphs under restrictions given by faces
• Every planar map is four colorable

This page was built for publication: Facial unique-maximum edge and total coloring of plane graphs