✦ LIBER ✦

Chromatic polynomials and logarithmic concavity

✍ Scribed by S.G Hoggar

Publisher: Elsevier Science
Year: 1974
Tongue: English
Weight: 361 KB
Volume: 16
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(74)90071-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Logarithmic Concavity and sl2(C)

✍ David G. Wagner 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 88 KB

We observe that for any logarithmically concave finite sequence a 0 , a 1 , ..., a n of positive integers there is a representation of the Lie algebra sl 2 (C) from which this logarithmic concavity follows. Thus, in applying this strategy to prove logarithmic concavity, the only issue is to construc

Chromatic polynomials and ?-polynomials

✍ Wakelin, C. D. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 827 KB

In this paper we present some results on the sequence of coefficients of the chromatic polynomial of a graph relative to the complete graph basis, that is, when it is expressed as the sum of the chromatic polynomials of complete graphs. These coefficients are the coefficients of what is often called

Chromatic polynomials and broken cycles

✍ S.G Hoggar 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Cutpoints and the chromatic polynomial

✍ Earl Glen Whitehead Jr.; Lian-Chang Zhao 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 303 KB

## Abstract We prove that the multiplicity of the root 1 in the chromatic polynomial of a simple graph __G__ is equal to the number of nontrivial blocks in __G__. In particular, a connected simple graph __G__ has a cutpoint if and only if its chromatic polynomial is divisible by (λ – 1)^2^. We appl

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.

Chromatic polynomials, polygon trees, an

Chromatic polynomials, polygon trees, and outerplanar graphs

✍ C. D. Wakelin; D. R. Woodall 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 370 KB

## Abstract It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recogniza