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

Pairs of Chromatically Equivalent Graphs

โœ Scribed by Kerri Morgan

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
351 KB
Volume
27
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.