scientific article; zbMATH DE number 637272

zbMath0805.05066MaRDI QIDQ4304323

Dingjun Lou

Publication date: 26 January 1995

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

zbMATH Keywords

connected graphperfect matching\(n\)-extendability

Mathematics Subject Classification ID

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

Related Items (5)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Minimally \(k\)-factor-critical graphs for some large \(k\) ⋮ \(M\)-alternating paths in \(n\)-extendable bipartite graphs ⋮ A local independence number condition for \(n\)-extendable graphs ⋮ On the structure of minimally \(n\)-extendable bipartite graphs

This page was built for publication: