Planar graphs with circular chromatic numbers between 3 and 4 (Q1306306): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 12:38, 31 January 2024
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
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
planar graph
0 references
circular chromatic number
0 references