✦ LIBER ✦

Two classes of chromatically unique graphs

✍ Scribed by K.M. Koh; B.H. Goh

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 563 KB
Volume: 82
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90041-f

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Classes of chromatically unique graphs

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

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 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

Classes of chromatically equivalent grap

Classes of chromatically equivalent graphs and polygon trees

✍ Shaoji Xu 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 747 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

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