The NP-Completeness of Edge-Coloring
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4), 718-720
- https://doi.org/10.1137/0210055
Abstract
No abstract availableThis publication has 1 reference indexed in Scilit:
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait ColorableThe American Mathematical Monthly, 1975