NP-completeness of edge-colouring some restricted graphs
- 1 January 1991
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 30 (1) , 15-27
- https://doi.org/10.1016/0166-218x(91)90010-t
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- NP completeness of finding the chromatic index of regular graphsJournal of Algorithms, 1983
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and TutteProceedings of the London Mathematical Society, 1979
- Sur l'indice chromatique du graphe representatif des aretes d'un graphe regulierDiscrete Mathematics, 1974
- Regular Graphs with Given Girth and Restricted CircuitsJournal of the London Mathematical Society, 1963
- From the theory of regular graphs of third and fourth degreeČasopis pro pěstování matematiky, 1957