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

Upper Bounds for the Automorphic Chromatic Index of a Graph

โœ Scribed by Giuseppe Mazzuoccolo, Beatrice Ruini

Book ID
120788857
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
399 KB
Volume
30
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the Automorphic Chromatic Index of a
On the Automorphic Chromatic Index of a Graph
โœ Carla Fiori; Giuseppe Mazzuoccolo; Beatrice Ruini ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer Japan ๐ŸŒ English โš– 266 KB
An upper bound for the harmonious chroma
An upper bound for the harmonious chromatic number of a graph
โœ Sin-Min Lee; John Mitchem ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB ๐Ÿ‘ 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o