A class of `matching-equivalent' bipartite graphs

DOI10.1016/S0012-365X(99)00006-0zbMath0932.05077WikidataQ127719174 ScholiaQ127719174MaRDI QIDQ1301665

C. R. Pranesachar

Publication date: 13 March 2000

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

zbMATH Keywords

bipartite graphsrook polynomial\(r\)-matchingsmatching-equivalent

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of `matching-equivalent' bipartite graphs