NP completeness of finding the chromatic index of regular graphs
- 1 March 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (1), 35-44
- https://doi.org/10.1016/0196-6774(83)90032-9
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981