𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatically Supremal Decompositions of Graphs

✍ Scribed by Robert E. Jamison; Eric Mendelsohn

Publisher
Springer Japan
Year
2010
Tongue
English
Weight
239 KB
Volume
26
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.

On the chromatic spectrum of acyclic dec
On the chromatic spectrum of acyclic decompositions of graphs
✍ Robert E. Jamison; Eric Mendelsohn πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## Abstract If __G__ is any graph, a __G‐decomposition__ of a __host__ graph __H__ = (__V__, __E__) is a partition of the edge set of __H__ into subgraphs of __H__ which are isomorphic to __G__. The __chromatic index__ of a __G__‐decomposition is the minimum number of colors required to color the p