✦ LIBER ✦

Chromatic polynomials of connected graphs

✍ Scribed by Chong-Yun Chao; Lian-Chang Zhao

Book ID: 112496117
Publisher: Springer
Year: 1984
Tongue: English
Weight: 276 KB
Volume: 43
Category: Article
ISSN: 0003-889X
DOI: 10.1007/bf01193920

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximal chromatic polynomials of connect

Maximal chromatic polynomials of connected planar graphs

✍ Ioan Tomescu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 429 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials of connected 3‐ and 4‐chromatic planar graphs that are maximal for positive integer‐valued arguments. We also characterize the class of connected 3‐chromatic graphs having the maximum number of __p__‐colorings for __p__ ≥ 3, thus extending a

Maximum chromatic polynomials of 2-conne

Maximum chromatic polynomials of 2-connected graphs

✍ Ioan Tomescu 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 345 KB 👁 1 views

## Abstract In this paper we obtain chromatic polynomials __P(G__; λ) of 2‐connected graphs of order __n__ that are maximum for positive integer‐valued arguments λ ≧ 3. The extremal graphs are cycles __C__~__n__~ and these graphs are unique for every λ ≧ 3 and __n__ ≠ 5. We also determine max{__P(

Maximal σ-polynomials of connected 3-chr

Maximal σ-polynomials of connected 3-chromatic graphs

✍ Ioan Tomescu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB 👁 1 views

## Abstract In the set of graphs of order __n__ and chromatic number __k__ the following partial order relation is defined. One says that a graph __G__ is less than a graph __H__ if __c__~__i__~(__G__) ≤ __c__~__i__~(__H__) holds for every __i__, __k__ ≤ __i__ ≤ __n__ and at least one inequality is

A Zero-Free Interval for Chromatic Polyn

A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs

✍ Dong, F. M.; Jackson, Bill 📂 Article 📅 2011 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 482 KB

The 3-connectivity of a graph and the mu

The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial

✍ F. M. Dong; K. M. Koh 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 691 KB

Let G be a graph of order n, maximum degree , and minimum degree . Let P(G, ) be the chromatic polynomial of G. It is known that the multiplicity of zero "0" of P(G, ) is one if G is connected, and the multiplicity of zero "1" of P(G, ) is one if G is 2-connected. Is the multiplicity of zero "2" of

The chromatic connectivity of graphs

✍ C. D. Godsil; R. Nowakowski; J. Nešetřil 📂 Article 📅 1988 🏛 Springer Japan 🌐 English ⚖ 291 KB