On improving the edge-face coloring theorem

DOI10.1007/PL00007248zbMath0983.05038OpenAlexW2008612641MaRDI QIDQ5943052

Yue Zhao, Daniel P. Sanders

Publication date: 28 October 2001

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00007248

zbMATH Keywords

plane graphsimultaneous colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (10)

The edge-face choosability of plane graphs ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Facial edge-face coloring of \(K_4\)-minor-free graphs ⋮ Entire colouring of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Edge-face list coloring of Halin graphs ⋮ Plane graphs with maximum degree 6 are edge-face 8-colorable ⋮ The edge-face coloring of graphs embedded in a surface of characteristic zero ⋮ Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks ⋮ Planar graphs of maximum degree seven are Class I

This page was built for publication: On improving the edge-face coloring theorem