Graphs with Chromatic Roots in the Interval (1, 2)

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).

• Type: Journal
• Year: 2007
• Where: COMBINATORICS
• Authors: Gordon F. Royle
• Keywords: 3-connected Non-bipartite Graphs, Chromatic Roots, COMBINATORICS 2007, Infinite Family