bipartite_regular_graph (511B)
1 # Bipartite regular graph 2 3 https://mathoverflow.net/questions/428212/perfect-matching-decomposition-algorithm-for-bipartite-regular-graphs 4 - a [bipartite_graph] can be decomposed into edge-disjoint [perfect_matchings] iff the [graph] is regular 5 - uses [Hall's_theorem], specifically [regular_bipartite_graph_perfect_matching] 6 - https://math.stackexchange.com/questions/4361540/if-g-is-n-regular-then-g-has-n-disjoint-perfect-matchings 7 8 Up: [graph_regular], [bipartite_graph] 9 10 Aliases: regular bipartite graph