Edge-Coloring Bipartite Graphs

Journal of Algorithms

Volumn 34, Issue 2, 2000, Pages 390-396

  Kapoor, Ajai ^a   Rizzi, Romeo ^a  

^a UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010618580     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1058     Document Type: Article

References (7)

1. R. Cole and J. Hopcroft, On edge coloring bipartite graphs, SIAM J. Comput. 11 (1982), 540-546.
2. H. N. Gabow, Using Euler partitions to edge color bipartite multigraphs, Internat. J. Comput. Inform. Sci. 5 (1976), 345-355.
3. H. N. Gabow and O. Kariv, Algorithms for edge coloring bipartite graphs and multigraphs, SIAM J. Comput. 11 (1982), 117-129.
4. D. Konig, Graphok és alkalmazásuk a determinánsok és a halmazok elméletére Math. Természettudományi Értesito 34 (1916), 104-119. [In Hungarian]
5. R. Rizzi, Konig's edge coloring theorem without augmenting paths, J. Graph Theory 29 (1998), 87.
6. R. Rizzi, Finding 1-factors in bipartite regular graphs, and edge-coloring bipartite graphs, submitted.
7. A. Schrijver, "Bipartite Edge-Colouring in O(Δm) Time," preprint, CWI, 1996.