Edge-Coloring Bipartite Graphs
- 29 February 2000
- journal article
- research article
- Published by Elsevier in Journal of Algorithms
- Vol. 34 (2) , 390-396
- https://doi.org/10.1006/jagm.1999.1058
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- König's edge coloring theorem without augmenting pathsJournal of Graph Theory, 1998
- On Edge Coloring Bipartite GraphsSIAM Journal on Computing, 1982
- Algorithms for Edge Coloring Bipartite Graphs and MultigraphsSIAM Journal on Computing, 1982
- Using euler partitions to edge color bipartite multigraphsInternational Journal of Parallel Programming, 1976