On defect restricted matching extension graphs

DOI10.1016/j.dam.2023.09.007OpenAlexW4386798402MaRDI QIDQ6184312

Yanping Xu, Zhiyong Gan

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.007

zbMATH Keywords

extendabilitymatching extensiondefect restricted matching

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing defect \(n\)-extendable bipartite graphs with different connectivities
• On n-extendable graphs
• On defect-d matchings in graphs
• Hamiltonian and long cycles in bipartite graphs with connectivity
• Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity
• Bipartite double cover and perfect 2-matching covered graph with its algorithm
• Characterizing defect \(n\)-extendable graphs and \((2n+1)\)-critical graphs
• Generalization of matching extensions in graphs

This page was built for publication: On defect restricted matching extension graphs