A simple algorithm for edge-coloring bipartite multigraphs
References (6)
- et al.
On edge-coloring bipartite graphs
SIAM J. Comput.
(1982) - et al.
Edge-coloring bipartite multigraphs in O(ElogD) time
Combinatorica
(2001) Using Euler partitions to edge color bipartite multigraphs
Internat. J. Comput. Inform. Sci.
(1976)
There are more references available in the full text version of this article.
Cited by (0)
- 1
Research supported in part by a USA–Israeli BSF grant, by the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University.
Copyright © 2002 Elsevier Science B.V. All rights reserved.