%0 Journal Article %1 royle07 %A Royle, Gordon F. %D 2007 %J Journal of Combinatorics %K algebraic.graph.theory chromatic graph.theory polynomial %N 3 %T Graphs with Chromatic Roots in the Interval $(1, 2)$ %U http://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n18 %V 14 %X 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).

@article{royle07, 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).}, added-at = {2015-05-22T08:55:58.000+0200}, author = {Royle, Gordon F.}, biburl = {https://www.bibsonomy.org/bibtex/20172e5c95871f814741d424eb4c29101/ytyoun}, interhash = {43efeed566b26b2b59884ab5d7ff0f8c}, intrahash = {0172e5c95871f814741d424eb4c29101}, journal = {Journal of Combinatorics}, keywords = {algebraic.graph.theory chromatic graph.theory polynomial}, number = 3, timestamp = {2016-02-28T10:55:29.000+0100}, title = {Graphs with Chromatic Roots in the Interval $(1, 2)$}, url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v14i1n18}, volume = 14, year = 2007 }