Using euler partitions to edge color bipartite multigraphs
From MaRDI portal
Publication:4198790
DOI10.1007/BF00998632zbMath0411.05039WikidataQ29028581 ScholiaQ29028581MaRDI QIDQ4198790
Publication date: 1976
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Related Items (19)
Space-Efficient Euler Partition and Bipartite Edge Coloring ⋮ Space-efficient Euler partition and bipartite edge coloring ⋮ Approximate constrained bipartite edge coloring ⋮ The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3 ⋮ Linear algorithms for edge-coloring trees and unicyclic graphs ⋮ Minimum multiplicity edge coloring via orientation ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ Short Proof of Galvin's Theorem on the List-chromatic Index of a Bipartite Multigraph ⋮ 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 ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ Edge coloring of bipartite graphs with constraints ⋮ The complexity of arc-colorings for directed hypergraphs ⋮ A simple algorithm for edge-coloring bipartite multigraphs ⋮ From L. Euler to D. König ⋮ A simple matching algorithm for regular bipartite graphs. ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems) ⋮ Rearrangeable nonblocking condition for multi-log\(_ 2 N\) multiconnection networks
Cites Work
This page was built for publication: Using euler partitions to edge color bipartite multigraphs
