Generalization of matching extensions in graphs. IV: Closures

DOI10.1007/S00373-016-1687-XzbMATH Open1351.05182OpenAlexW2341511494MaRDI QIDQ343759FDOQ343759

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

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

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

• On a closure concept in claw-free graphs
• Title not available (Why is that?)
• On n-extendable graphs
• Closure and Hamiltonian-connectivity of claw-free graphs
• A method in graph theory
• Extending matchings in graphs: A survey
• 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
• Title not available (Why is that?)
• Generalization of matching extensions in graphs

Cited In (3)

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

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)