Using euler partitions to edge color bipartite multigraphs

DOI10.1007/BF00998632MaRDI QIDQ4198790zbMATH OpenDBLPWikidataFDO

Authors Harold N. Gabow

Publication date 1976

Published in International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00998632

zbMATH Keywords

algorithmbipartite multigraphedge coloringEuler partition matching

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3564698 (Why is no real title available?)
• scientific article; zbMATH DE number 3230852 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3343723 (Why is no real title available?)

Cited in

(21)

• A simple algorithm for edge-coloring bipartite multigraphs
• Combinatorial analysis (nonnegative matrices, algorithmic problems)
• An implicit data structure for searching a multikey table in logarithmic time
• A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
• A parallel algorithm for approximating the minimum cycle cover
• Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks
• The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
• Space-efficient Euler partition and bipartite edge coloring
• Minimum multiplicity edge coloring via orientation
• Path multicoloring in spider graphs with even color multiplicity
• A simple matching algorithm for regular bipartite graphs.
• Approximate constrained bipartite edge coloring
• From L. Euler to D. König
• Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph
• Space-Efficient Euler Partition and Bipartite Edge Coloring
• The complexity of arc-colorings for directed hypergraphs
• The complexity of arc-colorings for directed hypergraphs
• Edge coloring of bipartite graphs with constraints
• Linear algorithms for edge-coloring trees and unicyclic graphs
• Enumeration algorithm for the edge coloring problem on bipartite graphs
• Density-sensitive algorithms for (+1)-edge coloring

This page was built for publication: Using euler partitions to edge color bipartite multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4198790)