Smallest close to regular bipartite graphs without an almost perfect matching

DOI10.1007/S10114-010-9124-1zbMath1216.05119OpenAlexW2075182507MaRDI QIDQ606288

Lutz Volkmann, Axel Zingsem

Publication date: 17 November 2010

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-010-9124-1

zbMATH Keywords

bipartite graphalmost perfect matchingclose to regular graph

Mathematics Subject Classification ID

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

Related Items (2)

Vertex-antimagic labelings of regular graphs ⋮ Topological minors in bipartite graphs

Cites Work

• On the order of certain close to regular graphs without a matching of given size
• The Factorization of Linear Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Smallest close to regular bipartite graphs without an almost perfect matching