The edge-face choosability of plane graphs

DOI10.1016/j.ejc.2003.12.007zbMath1050.05058OpenAlexW2067316312MaRDI QIDQ1883606

Ko-Wei Lih, Wei Fan Wang

Publication date: 13 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.12.007

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Facial list colourings of plane graphs ⋮ Entire colouring of plane graphs ⋮ The edge-face choosability of plane graphs with maximum degree at least 9 ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ 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

Cites Work

• Unnamed Item
• Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
• On simultaneous edge-face colorings of plane graphs
• Simultaneous coloring of edges and faces of plane graphs
• Every planar graph is 5-choosable
• Simultaneously colouring the edges and faces of plane graphs
• List edge and list total colourings of multigraphs
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• The list chromatic index of a bipartite multigraph
• Structural theorem on plane graphs with application to the entire coloring number
• Graphs of degree 4 are 5-edge-choosable
• On improving the edge-face coloring theorem

This page was built for publication: The edge-face choosability of plane graphs