Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

COMBINATORICS
2007

favoriteEmaildiscussreport

42views more COMBINATORICS 2007»

Graphs with Chromatic Roots in the Interval (1, 2)

13 years 4 months ago

Graphs with Chromatic Roots in the Interval (1, 2)

Download www.combinatorics.org

We present an inﬁnite 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 brieﬂy consider other graph classes that are conjectured to have no chromatic roots in (1, 2).

Gordon F. Royle

Real-time Traffic

3-connected Non-bipartite Graphs | Chromatic Roots | COMBINATORICS 2007 | Inﬁnite Family |

claim paper

Related Content

» A zerofree interval for flow polynomials of cubic graphs

» ZeroFree Intervals for Flow Polynomials of NearCubic Graphs

» Bar kVisibility Graphs Bounds on the Number of Edges Chromatic Number and Thickness

» On the adaptable chromatic number of graphs

» On Packing Colorings of Distance Graphs

» Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangemen...

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

» The NonCrossing Graph

» Oriented vertex and arc colorings of partial 2trees

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2007
Where	COMBINATORICS
Authors	Gordon F. Royle

Comments (0)