Extending matchings in odd graphs

MaRDI QIDQ3572929zbMATH OpenFDO

Authors Xiaofeng Guo, Shaohui Zhai

Publication date 8 July 2010

zbMATH Keywords

\( (n,k,d)\)-graphs\(k\)-extendable graphs\(n\)-factor-critical graphsnear \(k\)-extendable graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Generalization of matching extensions in graphs. III
• Generalization of matching extensions in graphs
• Construction characterizations for defect \(n\)-extendable bipartite graphs
• Generalization of matching extensions in graphs. II.
• Characterizing defect n-extendable graphs and (2n+1)-critical graphs

Cited in

(6)

• Odd subgraphs and matchings
• Extendability and criticality in matching theory
• Generalization of matching extensions in graphs. II.
• Extending matchings in planar odd graphs.
• Generalization of matching extensions in graphs. IV: Closures
• Generalization of matching extensions in graphs. III

This page was built for publication: Extending matchings in odd graphs

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