Abstract
AbstractBy the construction of suitable graphs and the determination of their chromatic polynomials, we resolve two open questions concerning real chromatic roots. First we exhibit graphs for which the Beraha number is a chromatic root. As it was previously known that no other noninteger Beraha number is a chromatic root, this completes the determination of precisely which Beraha numbers can be chromatic roots. Next we construct an infinite family of 3‐connected graphs such that for any , there is a member of the family with as a chromatic root of multiplicity at least . The former resolves a question of Salas and Sokal and the latter a question of Dong and Koh.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
