๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Chromatically unique graphs

โœ Scribed by Chong-Yun Chao; Earl Glen Whitehead Jr.

Book ID
107748304
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
493 KB
Volume
27
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On path-chromatically unique graphs
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
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.