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

The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3

โœ Scribed by Diamantis P. Koreas

Book ID
108396007
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
183 KB
Volume
83
Category
Article
ISSN
0096-3003

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The chromatic index of graphs with large
The chromatic index of graphs with large maximum degree
โœ Michael J. Plantholt ๐Ÿ“‚ Article ๐Ÿ“… 1983 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 508 KB

Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree A(G) or A(G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.