✦ LIBER ✦

T-chromatic polynomials

✍ Scribed by Ian Robertson

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 463 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0089-m

No coin nor oath required. For personal study only.

✦ Synopsis

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}. We show that there is a polynomial, QG(A), such that Qo(A)= T,(l) provided that 1 is big enough.

📜 SIMILAR VOLUMES

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

Coefficients of chromatic polynomials

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

Approximations for chromatic polynomials

✍ N.L Biggs; G.H.J Meredith 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 671 KB

A note concerning chromatic polynomials

✍ Chong-Yun Chao; Lian-Chang Zhao 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 180 KB