A simple proof of Moser's theorem

DOI10.1002/(SICI)1097-0118(199901)30:1%3C19::AID-JGT3%3E3.0.CO;2-XMaRDI QIDQ4256103zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

Publication date 25 January 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199901)30:1%3C19::aid-jgt3%3E3.0.co;2-x

zbMATH Keywords

circular chromatic numberplanar graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2061801
• scientific article; zbMATH DE number 2170470
• An analogue of Hajós' theorem for the circular chromatic number
• Planar graphs with circular chromatic numbers between 3 and 4

Cited in

(9)

• Planar graphs with circular chromatic numbers between 3 and 4
• Construction of \(K_{n}\)-minor free graphs with given circular chromatic number
• Circular chromatic number of signed graphs
• The circular chromatic numbers of signed series-parallel graphs
• An analogue of Hajós' theorem for the circular chromatic number
• A simplified proof of Moufang’s theorem
• scientific article; zbMATH DE number 4135067 (Why is no real title available?)
• scientific article; zbMATH DE number 943895 (Why is no real title available?)
• The circular chromatic number of series-parallel graphs with large girth

This page was built for publication: A simple proof of Moser's theorem

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