The edge-face coloring of graphs embedded in a surface of characteristic zero

DOI10.1016/j.disc.2007.12.055zbMath1213.05103OpenAlexW2150695805MaRDI QIDQ1025544

Wei Fan Wang

Publication date: 19 June 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.055

zbMATH Keywords

graphmaximum degreedischargingedge-face chromatic numbersurface of characteristic zero

Mathematics Subject Classification ID

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

Related Items (1)

Entire coloring of graphs embedded in a surface of nonnegative characteristic

Cites Work

• Unnamed Item
• On simultaneous edge-face colorings of plane graphs
• Simultaneous coloring of edges and faces of plane graphs
• Simultaneously colouring the edges and faces of plane graphs
• List edge and list total colourings of multigraphs
• Coloring edges of graphs embedded in a surface of characteristic zero.
• On simultaneous colorings of embedded graphs
• A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs
• Planar graphs of maximum degree seven are Class I
• The edge-face choosability of plane graphs
• Every planar map is four colorable
• Graphs of degree 4 are 5-edge-choosable
• Edge‐face chromatic number and edge chromatic number of simple plane graphs
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
• Every planar graph with maximum degree 7 is of class 1
• On improving the edge-face coloring theorem

This page was built for publication: The edge-face coloring of graphs embedded in a surface of characteristic zero