✦ LIBER ✦

Chromatically optimal rigid graphs

✍ Scribed by Jaroslav Nešetřil; Vojtěch Rödl

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 406 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90039-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Pairs of Chromatically Equivalent Graphs

✍ Kerri Morgan 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 351 KB

Chromatically Supremal Decompositions of

Chromatically Supremal Decompositions of Graphs

✍ Robert E. Jamison; Eric Mendelsohn 📂 Article 📅 2010 🏛 Springer Japan 🌐 English ⚖ 239 KB

A characterization of chromatically rigi

A characterization of chromatically rigid polynomials

✍ O. V. Vorodin; I. G. Dmitriev 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 486 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.