Graphs with chromatic roots in the interval \((1,2)\)
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
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)$.
DOI : 10.37236/1019
Classification : 05C15
Mots-clés : chromatic roots, non bipartite graphs
Gordon F. Royle. Graphs with chromatic roots in the interval \((1,2)\). The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/1019
@article{10_37236_1019,
     author = {Gordon F. Royle},
     title = {Graphs with chromatic roots in the interval \((1,2)\)},
     journal = {The electronic journal of combinatorics},
     year = {2007},
     volume = {14},
     doi = {10.37236/1019},
     zbl = {1157.05310},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1019/}
}
TY  - JOUR
AU  - Gordon F. Royle
TI  - Graphs with chromatic roots in the interval \((1,2)\)
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1019/
DO  - 10.37236/1019
ID  - 10_37236_1019
ER  - 
%0 Journal Article
%A Gordon F. Royle
%T Graphs with chromatic roots in the interval \((1,2)\)
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/1019/
%R 10.37236/1019
%F 10_37236_1019

Cité par Sources :