Generalization of matching extensions in graphs

DOI10.1016/S0012-365X(00)00328-9MaRDI QIDQ5937599zbMATH OpenWikidataFDO

Authors Guizhen Liu, Qinglin Roger Yu

Publication date 7 February 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(00)00328-9

zbMATH Keywords

bicritical graphscharacterizationconnectivityextendable graphsmatching

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. II.
• Matchings and matching extensions in graphs
• Generalization of matching extensions in graphs. III
• scientific article; zbMATH DE number 238423
• scientific article; zbMATH DE number 19207
• scientific article; zbMATH DE number 1563920
• scientific article; zbMATH DE number 4193713
• Extending matchings in graphs: A survey
• scientific article; zbMATH DE number 1161241
• Generalization of matching extensions in graphs. IV: Closures

Cited in

(26)

• Minimum degree of minimal defect n-extendable bipartite graphs
• Matching extension and the genus of a graph
• Matchings and matching extensions in graphs
• Minimal graphs for matching extensions
• The matching extension problem in general graphs is co-NP-complete
• The (\(n\), \(k\))-extendable graphs in surfaces
• Hamiltonian extendable graphs
• Extendability and criticality in matching theory
• Generalization of matching extensions in graphs. II.
• Characterizing defect n-extendable graphs and (2n+1)-critical graphs
• scientific article; zbMATH DE number 6828923 (Why is no real title available?)
• Generalization of matching extensions in graphs. IV: Closures
• BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS
• Extending matchings in odd graphs
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• scientific article; zbMATH DE number 13149 (Why is no real title available?)
• scientific article; zbMATH DE number 1123785 (Why is no real title available?)
• scientific article; zbMATH DE number 221322 (Why is no real title available?)
• Surface embedding of \((n,k)\)-extendable graphs
• Matching extension in prism graphs
• 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
• On defect restricted matching extension graphs
• A note on cyclic connectivity and matching properties of regular graphs
• Characterizing defect n-extendable bipartite graphs with different connectivities

This page was built for publication: Generalization of matching extensions in graphs

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