Graphs with chromatic roots in the interval (1,2)
Combinatorics
2007-05-23 v1
Abstract
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).
Cite
@article{arxiv.0704.2264,
title = {Graphs with chromatic roots in the interval (1,2)},
author = {Gordon F. Royle},
journal= {arXiv preprint arXiv:0704.2264},
year = {2007}
}