Circular chromatic numbers of some distance graphs (Q1773363): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.02.004 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2036907573 / rank | |||
Normal rank |
Revision as of 22:03, 19 March 2024
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
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