A simple proof of Moser's theorem
From MaRDI portal
Publication:4256103
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199901)30:1<19::AID-JGT3>3.0.CO;2-X" /><19::AID-JGT3>3.0.CO;2-X 10.1002/(SICI)1097-0118(199901)30:1<19::AID-JGT3>3.0.CO;2-XzbMath0929.05033OpenAlexW4240418723MaRDI QIDQ4256103
Publication date: 25 January 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199901)30:1<19::aid-jgt3>3.0.co;2-x
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (5)
The circular chromatic number of series-parallel graphs with large girth ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Circular chromatic number of signed graphs ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Planar graphs with circular chromatic numbers between 3 and 4
This page was built for publication: A simple proof of Moser's theorem
