Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306)

From MaRDI portal
Revision as of 09:28, 29 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Planar graphs with circular chromatic numbers between 3 and 4
scientific article

    Statements

    Planar graphs with circular chromatic numbers between 3 and 4 (English)
    0 references
    0 references
    20 December 1999
    0 references
    This paper proves that for every rational number \(r\) between 3 and 4, there exists a planar graph \(G\) whose circular chromatic number is equal to \(r\). Combining this result with a recent result of Moser, we arrive at the conclusion that every rational number \(r\) between 2 and 4 is the circular chromatic number of a planar graph. \(\copyright\) Academic Press.
    0 references
    0 references
    planar graph
    0 references
    circular chromatic number
    0 references
    0 references