✦ LIBER ✦

Coefficients of chromatic polynomials

✍ Scribed by G.H.J Meredith

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 129 KB
Volume: 13
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90003-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coefficient relationship between rook an

Coefficient relationship between rook and chromatic polynomials

✍ Kang Yueh; Samuel D. Bedrosian 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 289 KB

## ABSTRACC It is shown that a p +q node graph G, representation can be drawn for a chessboard C(p, q) i.e. an array of p rows and q columns. It is shown further that the coefficients of the rook polynomial for C(p, q) correspond 1: 1 inversely with the coefficients of the chromatic polynomial for

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

Ultimate chromatic polynomials

✍ Nigel Ray; William Schmitt 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 844 KB

We outline an approach to enumeration problems which relies on the algebra of free abelian groups, giving as our main application a generalisation of the chromatic polynomial of a simple graph G. Our polynomial lies in the free abelian group generated by the poset K(G) of contractions of G, and redu

Generalized chromatic polynomials

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

T-chromatic polynomials

✍ Ian Robertson 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Given a set T of nonnegative integers, a T-coloring of a graph G is a labeling of the vertices of G with positive integers such that no pair of adjacent vertices is labeled with integers differing by a number in T. Let Tc(,l) denote the number of ways to T-color G with numbers from the set (LZ..., A

Chromatic polynomials of generalized tre

Chromatic polynomials of generalized trees

✍ Earl Glen Whitehead Jr. 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 184 KB