Generalization of matching extensions in graphs. IV: Closures

DOI10.1007/S00373-016-1687-XMaRDI QIDQ343759zbMATH OpenOpenAlexFDO

Authors Hongliang Lu, Qinglin Roger Yu

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1687-x

zbMATH Keywords

closurematching extension\((n,k,d)\)-graph\(k\)-matching

Mathematics Subject Classification ID

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

Recommendations

• Generalization of matching extensions in graphs
• More powerful closure operations on graphs
• Generalization of matching extensions in graphs. III
• Generalization of matching extensions in graphs. II.
• Extending matchings in odd graphs

Cites work

• scientific article; zbMATH DE number 3141016 (Why is no real title available?)
• scientific article; zbMATH DE number 238423 (Why is no real title available?)
• A method in graph theory
• Closure and Hamiltonian-connectivity of claw-free graphs
• Closure and factor-critical graphs
• Extending matchings in graphs: A survey
• Generalization of matching extensions in graphs
• Generalization of matching extensions in graphs. II.
• Graph Factors and Matching Extensions
• Graphs with 1-Factors
• On \(k\)-factor-critical graphs
• On a closure concept in claw-free graphs
• On n-extendable graphs

Cited in

(3)

• Generalization of matching extensions in graphs. III
• Generalization of matching extensions in graphs
• Generalization of matching extensions in graphs. II.

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

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