Subset matching and edge coloring in bipartite graphs

DOI10.1016/j.endm.2016.10.031zbMath1356.05056OpenAlexW2551344807MaRDI QIDQ510962

Enver Kayaaslan, Ömer Can Yavuzyılmaz

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.031

zbMATH Keywords

bipartite graphmatchingedge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• A simple algorithm for edge-coloring bipartite multigraphs
• Fast Algorithms for Maximum Subset Matching and All-Pairs Shortest Paths in Graphs with a (Not So) Small Vertex Cover
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Edge-Coloring Bipartite Graphs

This page was built for publication: Subset matching and edge coloring in bipartite graphs