3-Coloring graphs embedded in surfaces

DOI10.1002/(SICI)1097-0118(200003)33:3%3C140::AID-JGT3%3E3.0.CO;2-3MaRDI QIDQ4948508zbMATH OpenOpenAlexFDO

Authors Yue Zhao

Publication date 11 April 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200003)33:3%3C140::aid-jgt3%3E3.0.co;2-3

zbMATH Keywords

3-coloringsurfacevertex coloring

Mathematics Subject Classification ID

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

Recommendations

• A note on the three color problem
• Planar graphs without 4, 6, 8-cycles are 3-colorable
• Three-coloring graphs embedded on surfaces with all faces even-sided
• Planar graphs without cycles of length from 4 to 7 are 3-colorable

Cited in

(7)

• A structural theorem on embedded graphs and its application to colorings
• Three-coloring graphs embedded on surfaces with all faces even-sided
• Coloring drawings of graphs
• On the Total Coloring of Graphs Embeddable in Surfaces
• scientific article; zbMATH DE number 7145382 (Why is no real title available?)
• The last excluded case of Dirac's map‐color theorem for choosability
• 3-regular maps on closed surfaces are nearly distinguishing 3-colorable with few exceptions

This page was built for publication: 3-Coloring graphs embedded in surfaces

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