Subset matching and edge coloring in bipartite graphs

DOI10.1016/J.ENDM.2016.10.031zbMATH Open1356.05056OpenAlexW2551344807MaRDI QIDQ510962FDOQ510962

Authors: Ömer Can Yavuzyılmaz, Enver Kayaaslan 

Publication date: 14 February 2017

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

Recommendations

• Algorithms for edge coloring bipartite graphs
• Bicolored matchings in some classes of graphs
• Edge-Coloring Bipartite Graphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time

zbMATH Keywords

matchingbipartite graphedge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Matching theory
• Algorithms for Edge Coloring Bipartite Graphs and Multigraphs
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• Combinatorial optimization. Networks and matroids
• 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
• Edge-Coloring Bipartite Graphs

Cited In (3)

• Perfect matchings in antipodally colored lattice of subsets
• Matchings in colored bipartite networks
• Title not available (Why is that?)

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

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