✦ LIBER ✦

Another family of chromatically unique graphs

✍ Scribed by Yee-Hock Peng

Publisher: Springer Japan
Year: 1995
Tongue: English
Weight: 368 KB
Volume: 11
Category: Article
ISSN: 0911-0119
DOI: 10.1007/bf01793016

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

On path-chromatically unique graphs

✍ Esperanza Blancaflor Arugay; Severino Villanueva Gervacio 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 230 KB

The least number of colors needed to color the vertices of a graph G such that the vertices in each color class induces a linear forest is called the path-chromatic number of G, denoted by Zoo (G). If all such colorings of the vertices of G induce the same partitioning of the vertices of G, we say

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 unique or equiv

Classes of chromatically unique or equivalent graphs

✍ Mieczys[lstrok]aw Borowiecki; Ewa Drgas-Burchardt 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 439 KB

On chromatic uniqueness of two infinite

On chromatic uniqueness of two infinite families of graphs

✍ Feng-Ming Dong 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB 👁 1 views

## Abstract In this paper, it is proven that for each __k__ ≥ 2, __m__ ≥ 2, the graph Θ~__k__~(__m,…,m__), which consists of __k__ disjoint paths of length __m__ with same ends is chromatically unique, and that for each __m, n__, 2 ≤ __m__ ≤ __n__, the complete bipartite graph __K__~__m,n__~ is chr

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.