Graphs with chromatic roots in the interval (1,2)
| dc.creator | Royle, Gordon F. | |
| dc.date | 2007-04-18 | |
| dc.date.accessioned | 2026-07-07T07:56:58Z | |
| dc.date.available | 2026-07-07T07:56:58Z | |
| dc.description | 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). | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/0704.2264 | |
| dc.identifier | http://arxiv.org/abs/0704.2264 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/127514 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C15 | |
| dc.title | Graphs with chromatic roots in the interval (1,2) | |
| dc.type | text |