𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of chromatically unique graphs having quadratic σ-polynomials

✍ Scribed by Nian-Zu Li; Earl Glen Whitehead Jr.; Shao-Ji Xu

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
329 KB
Volume
11
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

Frucht and Giudici classified all graphs having quadratic a-polynomials.

Here w e classify all chromatically unique graphs having quadratic (Tpolynomials.

📜 SIMILAR VOLUMES

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