A better than “best possible” algorithm to edge color multigraphs
- 31 March 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (1) , 79-104
- https://doi.org/10.1016/0196-6774(86)90039-8
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Edge‐coloring of multigraphs: Recoloring techniqueJournal of Graph Theory, 1984
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949