Minimum degree of minimal defect \(n\)-extendable bipartite graphs

DOI10.1016/J.DISC.2009.06.013zbMath1229.05159OpenAlexW2067131486MaRDI QIDQ1045020

Zihui Yang, Xuelian Wen

Publication date: 15 December 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.06.013

zbMATH Keywords

near perfect matchingdefect \(n\)-extendableminimal defect \(n\)-extendable

Mathematics Subject Classification ID

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

Related Items (1)

M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities

Cites Work

• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• On n-extendable graphs
• On defect-d matchings in graphs
• On the structure of minimally \(n\)-extendable bipartite graphs
• Extending matchings in graphs: A survey
• On Representatives of Subsets
• Generalization of matching extensions in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum degree of minimal defect \(n\)-extendable bipartite graphs