✦ LIBER ✦

Chromatic polynomials of generalized trees

✍ Scribed by Earl Glen Whitehead Jr.

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 184 KB
Volume: 72
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90231-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized chromatic polynomials

✍ David Joyce 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 739 KB

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

Coefficients of chromatic polynomials

✍ G.H.J Meredith 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 129 KB

The limit of chromatic polynomials

✍ D Kim; I.G Enting 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 639 KB

Chromaticity of two-trees

✍ Earl Glen Whitehead Jr. 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

A Symmetric Function Generalization of t

A Symmetric Function Generalization of the Chromatic Polynomial of a Graph

✍ R.P. Stanley 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

For a finite graph \(G\) with \(d\) vertices we define a homogeneous symmetric function \(X_{4 ;}\) of degree \(d\) in the variables \(x_{1}, x_{2}, \ldots\). If we set \(x_{1}=\cdots=x_{n}=1\) and all other \(x_{t}=0\), then we obtain \(Z_{1}(n)\), the chromatic polynomial of (; evaluated at \(n\).