✦ LIBER ✦

A note concerning chromatic polynomials

✍ Scribed by Chong-Yun Chao; Lian-Chang Zhao

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 180 KB
Volume: 45
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90182-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note concerning the chromatic index of

A note concerning the chromatic index of multigraphs

✍ A. J. W. Hilton; Bill Jackson 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

We improve an upper bound for the chromatic index of a multigraph due to Andersen and Gol'dberg. As a corollary w e deduce that if no t w o edges of multiplicity at least t w o in G are adjacent, then ,y'(G) s A ( G ) + 1. In addition w e generalize results concerning the structure of critical graph

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 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

Proof of a Chromatic Polynomial Conjectu

Proof of a Chromatic Polynomial Conjecture

✍ F.M. Dong 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))

On a theorem concerning exponential poly

On a theorem concerning exponential polynomials

✍ Harold N. Shapiro 📂 Article 📅 1959 🏛 John Wiley and Sons 🌐 English ⚖ 638 KB

Chromatic polynomials and whitney's brok

Chromatic polynomials and whitney's broken circuits

✍ Ruth A. Bari; Dick Wick Hall 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB

## Abstract The theorem of Hassler Whitney, which gives the chromatic polynomial of a graph in terms of “broken circuits,” is used to derive a new formula for the coefficients of chromatic polynomials.