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

DOI10.1137/S0895480199351136zbMath1007.05082OpenAlexW2047825085MaRDI QIDQ4785684

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

zbMATH Keywords

edge-coloringperfect matchingregular bipartite graphstime-tabling

Mathematics Subject Classification ID

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

Related Items (2)

Graph factors and factorization: 1985--2003: a survey ⋮ Expander graphs and gaps between primes

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