✦ LIBER ✦

The chromatic polynomial of an unlabeled graph

✍ Scribed by P Hanlon

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 615 KB
Volume: 38
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(85)90068-1

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(

A Symmetric Function Generalization of t

A Symmetric Function Generalization of the Chromatic Polynomial of a Graph

✍ R.P. Stanley 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 932 KB

For a finite graph \(G\) with \(d\) vertices we define a homogeneous symmetric function \(X_{4 ;}\) of degree \(d\) in the variables \(x_{1}, x_{2}, \ldots\). If we set \(x_{1}=\cdots=x_{n}=1\) and all other \(x_{t}=0\), then we obtain \(Z_{1}(n)\), the chromatic polynomial of (; evaluated at \(n\).

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

Classification of chromatically unique g

Classification of chromatically unique graphs having quadratic σ-polynomials

✍ Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 329 KB 👁 1 views

Frucht and Giudici classified all graphs having quadratic a-polynomials. Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

Expansions of the chromatic polynomial

✍ Norman Biggs 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 739 KB

The chromatic polynomial ;X chromial) of a graph was first defined by Birkhoff in 1912, ;md gives the number of ways or" properly colov iing the vertices of the graph with any number of colours. A good survey of the b-sic facts about these polynomials may be found in the article by Read [ 3 3 . It