✦ LIBER ✦

Classes of chromatically unique or equivalent graphs

✍ Scribed by Mieczys[lstrok]aw Borowiecki; Ewa Drgas-Burchardt

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 439 KB
Volume: 121
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90532-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classes of chromatically unique graphs

✍ Mieczysław Borowiecki; Ewa Drgas-Burchardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 263 KB

Two classes of chromatically unique grap

Two classes of chromatically unique graphs

✍ K.M. Koh; B.H. Goh 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 563 KB

## Let P(G; A) denote the chromatic polynomial of a graph G. G is chromatically unique if G is isomorphic to H for any graph H with P(H; A) = P(G; A). In this paper, we provide two new classes of chromatically unique graphs.

Classes of chromatically equivalent grap

Classes of chromatically equivalent graphs and polygon trees

✍ Shaoji Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 747 KB

On the chromatic equivalence class of a

On the chromatic equivalence class of a family of graphs

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant

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

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.