scientific article; zbMATH DE number 2104723

MaRDI QIDQ4818792zbMATH OpenFDO

Authors Dingjun Lou, Qinglin Roger Yu

Publication date 1 October 2004

zbMATH Keywords

perfect matchings\(n\)-extendable graphs\(n\)-matchable graphs

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 871171
• Matching extension and minimum degree
• On (n,k)-extendable graphs and induced subgraphs
• Matchings and matching extensions in graphs
• scientific article; zbMATH DE number 734454

Cited in

(8)

• Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs
• A Necessary Condition and a Sufficient Condition for Pairwise Compatibility Graphs
• Minimum degree of minimal \((n-10)\)-factor-critical graphs
• Surface embedding of \((n,k)\)-extendable graphs
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
• Minimum \(k\)-critical bipartite graphs
• Minimally \(k\)-factor-critical graphs for some large \(k\)
• scientific article; zbMATH DE number 1471076 (Why is no real title available?)

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