Graphs with Chromatic Roots in the Interval $(1,2)$
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)$.
Published
2007-08-31
How to Cite
Royle, G. F. (2007). Graphs with Chromatic Roots in the Interval $(1,2)$. The Electronic Journal of Combinatorics, 14(1), N18. https://doi.org/10.37236/1019
Issue
Article Number
N18