Edge-Coloring Bipartite Multigraphs in O(E logD) Time

Let V, E, and D denote the cardinality of the vertex set, the cardinality of the edge set, and the maximum degree of a bipartite multigraph G. We show that a minimal edge-coloring of G can be computed in O(E logD time. This result follows from an algorithm for finding a matching in a regular bipartite graph in O(E) time.

This is a preview of subscription content, access via your institution.

Author information



Additional information

Received September 23, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Cole, R., Ost, K. & Schirra, S. Edge-Coloring Bipartite Multigraphs in O(E logD) Time. Combinatorica 21, 5–12 (2001). https://doi.org/10.1007/s004930170002

Download citation

  • AMS Subject Classification (1991) Classes:  68W05, 68W40