scientific article; zbMATH DE number 2104723

zbMath1061.05074MaRDI QIDQ4818792

Dingjun Lou, Qinglin Yu

Publication date: 1 October 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items (6)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Minimum \(k\)-critical bipartite graphs ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs

This page was built for publication: