Distance graphs with maximum chromatic number
Let $D$ be a finite set of integers. The distance graph $G(D)$ has the set of integers as vertices and two vertices at distance $d ∈D$ are adjacent in $G(D)$. A conjecture of Xuding Zhu states that if the chromatic number of $G (D)$ achieves its maximum value $|D|+1$ then the graph has a clique of o...
| Huvudupphovsmän: | , |
|---|---|
| Materialtyp: | Artikel |
| Språk: | English |
| Publicerad: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
| Serie: | Discrete Mathematics & Theoretical Computer Science |
| Ämnen: | |
| Länkar: | https://dmtcs.episciences.org/3391/pdf |