scientific article; zbMATH DE number 4193713

MaRDI QIDQ5202207zbMATH OpenFDO

Authors Michael D. Plummer

Publication date 1988

Mathematics Subject Classification ID

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

Cited in

(18)

• Minimum degree of minimal defect n-extendable bipartite graphs
• Well-covered graphs and extendability
• Extending matchings in claw-free graphs
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Matchings and matching extensions in graphs
• The matching extension problem in general graphs is co-NP-complete
• Toughness and matching extension in graphs
• On 2-extendable abelian Cayley graphs
• Independence number in n-extendable graphs
• Counting perfect matchings in \(n\)-extendable graphs
• scientific article; zbMATH DE number 6001476 (Why is no real title available?)
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• Matching extension in prism graphs
• Generalization of matching extensions in graphs
• Removable ears of 1-extendable graphs
• Matching and edge-connectivity in regular graphs
• Spectral conditions for k-extendability and k-factors of bipartite graphs
• Eigenvalues and factors: a survey

This page was built for publication:

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