Perfect Matchings of Regular Bipartite Graphs

DOI10.1002/jgt.22076zbMath1365.05234OpenAlexW2515819996MaRDI QIDQ5272932

Edita Rollová, Robert Lukot'ka

Publication date: 5 July 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22076

zbMATH Keywords

bipartite graphregular graphperfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)

Related Items (1)

A characterization of nonfeasible sets in matching covered graphs

Cites Work

• Unnamed Item
• Signed graphs
• Counting 1-factors in regular bipartite graphs
• The traveling salesman problem on cubic and subcubic graphs
• Characterizations of signed graphs
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: Perfect Matchings of Regular Bipartite Graphs