Circular chromatic numbers of some distance graphs (Q1773363)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Circular chromatic numbers of some distance graphs |
scientific article; zbMATH DE number 2162066
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circular chromatic numbers of some distance graphs |
scientific article; zbMATH DE number 2162066 |
Statements
Circular chromatic numbers of some distance graphs (English)
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
0.9611107
0 references
0.9576908
0 references
0.9561634
0 references
0.94694763
0 references
0.9461507
0 references
