On Diagonally 10‐Coloring Plane Triangulations

DOI10.1002/jgt.3190200108zbMath0833.05034OpenAlexW1976502149MaRDI QIDQ4843507

Yue Zhao, Daniel P. Sanders

Publication date: 18 March 1996

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

Full work available at URL: https://doi.org/10.1002/jgt.3190200108

zbMATH Keywords

plane triangulationcolorsreducible configurationdiagonal \(k\)-coloringdiagonal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (5)

Borodin's conjecture on diagonal coloring is false ⋮ On the \(d\)-distance face chromatic number of plane graphs ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ On cyclic colorings and their generalizations ⋮ Coloring the faces of convex polyhedra so that like colors are far apart

This page was built for publication: On Diagonally 10‐Coloring Plane Triangulations