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

DOI10.1016/J.DISC.2007.12.055MaRDI QIDQ1025544zbMATH OpenOpenAlexFDO

Authors Weifan 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)

Recommendations

• Edge-face coloring of 2-connected plane graphs
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• Edge-face chromatic number of 2-connected plane graphs with high maximum degree
• Edge colorings of graphs embeddable in a surface of low genus
• Coloring edges of embedded graphs

Cites work

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

Cited in

(8)

• Edge colorings of graphs embeddable in a surface of low genus
• On simultaneous colorings of embedded graphs
• On \(d\)-diagonal colorings of embedded graphs of low maximum face size
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• Coloring edges of graphs embedded in a surface of characteristic zero.
• Edge-face chromatic number of 2-connected plane graphs with high maximum degree
• Edge coloring of graphs embedded in a surface of nonnegative characteristic
• On the face touching number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025544)