Using euler partitions to edge color bipartite multigraphs

  • Harold N. Gabow

DOI: 10.1007/BF00998632

Cite this article as:
Gabow, H.N. International Journal of Computer and Information Sciences (1976) 5: 345. doi:10.1007/BF00998632


An algorithm for finding a minimal edge coloring of a bipartite multigraph is presented. The algorithm usesO(V1/2ElogV + V) time andO(E + V) space. It is based on a divide-and-conquer strategy, using euler partitions to divide the graph. A modification of the algorithm for matching is described. This algorithm finds a maximum matching of a regular bipartite graph with all degrees 2n, inO(E + V) time andO(E + V) space.

Key words

Edge coloring euler partition matching divide-and-conquer multigraph regular bipartite graph 

Copyright information

© Plenum Publishing Corporation 1976

Authors and Affiliations

  • Harold N. Gabow
    • 1
  1. 1.Department of Computer ScienceUniversity of ColoradoBoulder

Personalised recommendations