𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Classification of Graphs Having Cubic σ-Polynomials

✍ Scribed by NIAN-ZU LI; EARL GLEN WHITEHEAD JR.

Book ID
119862783
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
342 KB
Volume
576
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

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

On σ-polynomials and a class of chromati
On σ-polynomials and a class of chromatically unique graphs
✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi