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
CITATION STYLE
APA
Royle, G. F. (2007). Graphs with chromatic roots in the interval (1,2). Electronic Journal of Combinatorics, 14(1 N). https://doi.org/10.37236/1019
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free