Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs

DOI10.1137/S0895480199351136zbMATH Open1007.05082OpenAlexW2047825085MaRDI QIDQ4785684FDOQ4785684

Authors: Romeo Rizzi 

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480199351136

Recommendations

• Edge-Coloring Bipartite Graphs
• Bipartite Edge Coloring in $O(\Delta m)$ Time
• On the enumeration of bipartite minimum edge colorings
• Algorithms for edge coloring bipartite graphs
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time

zbMATH Keywords

edge-coloringperfect matchingregular bipartite graphstime-tabling

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (6)

• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• 1-factorization of regular graphs by colour exchange
• Bipartite multigraphs with 1‐factors containing specified edges
• Expander graphs and gaps between primes
• Algorithms for edge coloring bipartite graphs
• Graph factors and factorization: 1985--2003: a survey

This page was built for publication: Finding 1-Factors in Bipartite Regular Graphs and Edge-Coloring Bipartite Graphs

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