Graphs with chromatic roots in the interval \((1,2)\)
The electronic journal of combinatorics, Tome 14 (2007)
Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website
Zbl arXiv EuDML
We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval $(1,2)$ thus resolving a conjecture of Jackson's in the negative. In addition, we briefly consider other graph classes that are conjectured to have no chromatic roots in $(1,2)$.
Gordon F. Royle. Graphs with chromatic roots in the interval \((1,2)\). The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1019
@article{10_37236_1019,
author = {Gordon F. Royle},
title = {Graphs with chromatic roots in the interval \((1,2)\)},
journal = {The electronic journal of combinatorics},
year = {2007},
volume = {14},
doi = {10.37236/1019},
zbl = {1157.05310},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1019/}
}
Cité par Sources :