𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs

✍ Scribed by Dong, F. M.; Jackson, Bill

Book ID
118197871
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
482 KB
Volume
25
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A zero-free interval for chromatic polyn
A zero-free interval for chromatic polynomials
✍ D.R. Woodall πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 458 KB

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

Cyclic Chromatic Number of 3-Connected P
Cyclic Chromatic Number of 3-Connected Plane Graphs
✍ Enomoto, Hikoe; HornΓ‘k, Mirko; Jendrol', Stanislav πŸ“‚ Article πŸ“… 2001 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 200 KB
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