On the order of close to regular graphs without a matching of given size.

zbMATH Open1224.05408MaRDI QIDQ3070197FDOQ3070197

Sabine Klinkenberg, Lutz Volkmann

Publication date: 2 February 2011

Recommendations

• On the order of certain close to regular graphs without a matching of given size
• scientific article; zbMATH DE number 5053297
• scientific article; zbMATH DE number 2104722
• Smallest close to regular bipartite graphs without an almost perfect matching
• Maximum matchings in a regular graph of specified connectivity and bounded order

zbMATH Keywords

matchingclose to regular graph

Mathematics Subject Classification ID

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

Cited In (5)

• On the order of certain close to regular graphs without a matching of given size
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Smallest close to regular bipartite graphs without an almost perfect matching

This page was built for publication: On the order of close to regular graphs without a matching of given size.

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