Circular chromatic numbers of some distance graphs (Q1773363)

From MaRDI portal
Revision as of 08:44, 1 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Circular chromatic numbers of some distance graphs
scientific article

    Statements

    Circular chromatic numbers of some distance graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2005
    0 references
    The circular chromatic number of a graph is a natural generalization of the chromatic number (introduced under the name star chromatic number) of a graph. It is the infimum of the ratios \(p/q\) for which there exist \((p,q)\)-colourings of a graph. The authors determine the circular chromatic numbers of some graphs.
    0 references
    0 references