✦ LIBER ✦

On Chromatic Polynomials of Some Kinds of Graphs

✍ Scribed by Rong-xia Hao; Yan-pei Liu

Publisher: Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2004
Tongue: English
Weight: 159 KB
Volume: 20
Category: Article
ISSN: 0168-9673
DOI: 10.1007/s10255-004-0164-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic polynomial of a graph

✍ David Avis; Caterina De Simone; Paolo Nobili 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 121 KB

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(

Some kinds of energies of graphs

✍ Mirko Lepović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 336 KB

TorgaSev (1986) described all finite connected graphs whose energy (i.e. the sum of all positive eigenvalues including also their multiplicities), does not exceed 3. In this paper, we introduce definitions of some other kinds of energies and we prove some properties of them.

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

The chromatic polynomial of an unlabeled

The chromatic polynomial of an unlabeled graph

✍ P Hanlon 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 615 KB