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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jctb.1999.1900 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004002579 / rank
 
Normal rank

Revision as of 01:04, 20 March 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
    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