๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A zero-free interval for chromatic polynomials

โœ Scribed by D.R. Woodall

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
458 KB
Volume
101
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Woodall, D.R., A zero-free interval for chromatic polynomials, Discrete Mathematics 101 (1992) 333-341.

It is proved that, for a wide class of near-triangulations of the plane, the chromatic polynomial has no zeros between 2 and 2.5. Together with a previously known result, this shows that the zero of the chromatic polynomial of the octahedron at 2.546602.

. . is the smallest non-integer real zero of any chromatic polynomial of a plane triangulation.

๐Ÿ“œ SIMILAR VOLUMES

A Matrix Method for Chromatic Polynomial
A Matrix Method for Chromatic Polynomials
โœ Norman Biggs ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 111 KB

The chromatic polynomials of certain families of graphs can be expressed in terms of the eigenspaces of a linear operator. The operator is represented by a matrix, which is referred to here as the compatibility matrix. In this paper complete sets of eigenfunctions are obtained for several related fa

A tighter bounding interval for the 1-ch
A tighter bounding interval for the 1-chromatic number of a surface
โœ Vladimir P. Korzhik ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 889 KB

Let ~1(S) be the maximum chromatic number for all graphs which can be drawn on a surface S so that each edge is crossed over by no more than one other edge. In the previous paper the author has proved that F(S) -34 ~< ~1(S), where F(S) = [\_ยฝ(9 + ~/(81 -32E(S))).J is Ringel's upper bound for xl(S) a

The 3-connectivity of a graph and the mu
The 3-connectivity of a graph and the multiplicity of zero โ€œ2โ€ of its chromatic polynomial
โœ F. M. Dong; K. M. Koh ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 691 KB

Let G be a graph of order n, maximum degree , and minimum degree . Let P(G, ) be the chromatic polynomial of G. It is known that the multiplicity of zero "0" of P(G, ) is one if G is connected, and the multiplicity of zero "1" of P(G, ) is one if G is 2-connected. Is the multiplicity of zero "2" of