Circular chromatic numbers and fractional chromatic numbers of distance graphs (Q1266350)
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 and fractional chromatic numbers of distance graphs |
scientific article; zbMATH DE number 1199923
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circular chromatic numbers and fractional chromatic numbers of distance graphs |
scientific article; zbMATH DE number 1199923 |
Statements
Circular chromatic numbers and fractional chromatic numbers of distance graphs (English)
0 references
16 September 1998
0 references
This paper studies the circular (or star) chromatic numbers and fractional chromatic numbers of distance graphs \(G(Z, D)\) for various sets \(D\) (being the graph with vertex set a subset of the integers, and two vertices \(x\), \(y\) being adjacent iff \(| x-y|\in D\)). Various specific cases are calculated, including all cases when \(| D|= 2\).
0 references
circular
0 references
chromatic numbers
0 references
fractional
0 references
distance graphs
0 references
