Generalization of matching extensions in graphs
From MaRDI portal
Publication:5937599
DOI10.1016/S0012-365X(00)00328-9zbMath0978.05062WikidataQ126851609 ScholiaQ126851609MaRDI QIDQ5937599
Publication date: 7 February 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (15)
Generalization of matching extensions in graphs. II. ⋮ Hamiltonian extendable graphs ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ Characterizing defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Minimal graphs for matching extensions ⋮ On defect restricted matching extension graphs ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS ⋮ The (\(n\), \(k\))-extendable graphs in surfaces ⋮ M-alternating paths and the construction of defect \(n\)-extendable bipartite graphs with different connectivities ⋮ Generalization of matching extensions in graphs. III ⋮ Algorithms for (0, 1,d)-graphs withdconstrains ⋮ Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs ⋮ A note on cyclic connectivity and matching properties of regular graphs ⋮ Minimum degree of minimal defect \(n\)-extendable bipartite graphs
This page was built for publication: Generalization of matching extensions in graphs
