✦ LIBER ✦

Approximations for chromatic polynomials

✍ Scribed by N.L Biggs; G.H.J Meredith

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 671 KB
Volume: 20
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(76)90062-9

No coin nor oath required. For personal study only.

📜 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

An inequality for chromatic polynomials

✍ D.R. Woodall 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 250 KB

Woodall, D.R., An inequality for chromatic polynomials, Discrete Mathematics 101 (1992) 327-331. It is proved that if P(G, t) is the chromatic polynomial of a simple graph G with II vertices, m edges, c components and b blocks, and if t S 1, then IP(G, t)/ 2 1t'(tl)hl(l + ys + ys2+ . + yF' +spl), wh

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

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