Smallest close to regular bipartite graphs without an almost perfect matching

DOI10.1007/S10114-010-9124-1MaRDI QIDQ606288zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 6374021
• On the order of almost regular bipartite graphs without perfect matchings
• scientific article; zbMATH DE number 3968625
• On the perfect matchings of near regular graphs
• Perfect matchings of regular bipartite graphs
• Non-bipartite distance-regular graphs with a small smallest eigenvalue
• On biregular bipartite graphs of small excess
• Smallest maximal matchings of graphs
• Perfect matchings in regular bipartite graphs
• Small bi-regular graphs of even girth

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 3733963 (Why is no real title available?)
• scientific article; zbMATH DE number 26496 (Why is no real title available?)
• scientific article; zbMATH DE number 637281 (Why is no real title available?)
• scientific article; zbMATH DE number 2104722 (Why is no real title available?)
• scientific article; zbMATH DE number 843316 (Why is no real title available?)
• scientific article; zbMATH DE number 5053297 (Why is no real title available?)
• On the order of almost regular bipartite graphs without perfect matchings
• On the order of certain close to regular graphs without a matching of given size
• On the order of close to regular graphs without a matching of given size.
• The Factorization of Linear Graphs

Cited in

(7)

• On the order of certain close to regular graphs without a matching of given size
• scientific article; zbMATH DE number 6374021 (Why is no real title available?)
• scientific article; zbMATH DE number 2104722 (Why is no real title available?)
• Vertex-antimagic labelings of regular graphs
• On the order of close to regular graphs without a matching of given size.
• On the order of almost regular bipartite graphs without perfect matchings
• Topological minors in bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606288)