On the $1.1$ Edge-Coloring of Multigraphs
- 1 August 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 3 (3) , 391-410
- https://doi.org/10.1137/0403035
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the f-coloring of multigraphsIEEE Transactions on Circuits and Systems, 1988
- A generalization of edge‐coloring in graphsJournal of Graph Theory, 1986
- A better than “best possible” algorithm to edge color multigraphsJournal of Algorithms, 1986
- Edge‐coloring of multigraphs: Recoloring techniqueJournal of Graph Theory, 1984
- 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
- On edge-colorings of graphs.MATHEMATICA SCANDINAVICA, 1977
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949