Premium
A simple proof of Moser's theorem
Author(s) -
Zhu Xuding
Publication year - 1999
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/(sici)1097-0118(199901)30:1<19::aid-jgt3>3.0.co;2-x
Subject(s) - mathematics , combinatorics , simple (philosophy) , planar graph , graph , discrete mathematics , chromatic scale , philosophy , epistemology
This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r . © 1999 John Wiley & Sons, Inc. J Graph Theory 30: 19–26, 1999