Generalization of matching extensions in graphs. IV: Closures

DOI10.1007/S00373-016-1687-XzbMath1351.05182OpenAlexW2341511494MaRDI QIDQ343759

Qinglin Yu, Hongliang Lu

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)

Cites Work

• Unnamed Item
• Unnamed Item
• On n-extendable graphs
• A method in graph theory
• Closure and Hamiltonian-connectivity of claw-free graphs
• Extending matchings in graphs: A survey
• On a closure concept in claw-free graphs
• Closure and factor-critical graphs
• Generalization of matching extensions in graphs. II.
• On k-factor-critical graphs
• Graph Factors and Matching Extensions
• Graphs with 1-Factors
• Generalization of matching extensions in graphs

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