Edge‐coloring of multigraphs: Recoloring technique
- 1 March 1984
- journal article
- Published by Wiley in Journal of Graph Theory
- Vol. 8 (1), 123-137
- https://doi.org/10.1002/jgt.3190080115
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Construction of class 2 graphs with maximum vertex degree 3Journal of Combinatorial Theory, Series B, 1981
- A construction of chromatic index critical graphsJournal of Graph Theory, 1981
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and TutteProceedings of the London Mathematical Society, 1979
- On small graphs critical with respect to edge colouringsDiscrete Mathematics, 1976
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait ColorableThe American Mathematical Monthly, 1975
- Some remarks on the chromatic index of a graphArchiv der Mathematik, 1973
- On the edge-chromatic number of a graphDiscrete Mathematics, 1973
- Investigations on an edge coloring problemDiscrete Mathematics, 1971
- The chromatic class of a multigraphCybernetics and Systems Analysis, 1965
- A Theorem on Coloring the Lines of a NetworkJournal of Mathematics and Physics, 1949