We present an infinite family of 3-connected non-bipartite graphs with chrom atic 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 conjetured to have no chromatic roots in (1, 2).
|Pages (from-to)||online - approx 5-20pp|
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 2007|