On Edge Coloring Bipartite Graphs
- 1 August 1982
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 11 (3) , 540-546
- https://doi.org/10.1137/0211043
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- 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
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite GraphsSIAM Journal on Computing, 1973