Toughness and matching extension in graphs

DOI10.1016/0012-365X(88)90221-XzbMath0683.05034MaRDI QIDQ1824634

Michael D. Plummer

Publication date: 1988

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

zbMATH Keywords

toughnessmatching extendability

Mathematics Subject Classification ID

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

Related Items (14)

Binding number and toughness for matching extension ⋮ Measuring the vulnerability for classes of intersection graphs ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Minimal graphs for matching extensions ⋮ Matching extension and distance spectral radius ⋮ On the restricted matching extension of graphs on the torus and the Klein bottle ⋮ Graph toughness from Laplacian eigenvalues ⋮ BIPARTITE MATCHING EXTENDABILITY AND TOUGHNESS ⋮ Some results on binding number and fractional perfect matching ⋮ Matching theory -- a sampler: From Dénes König to the present ⋮ Toughness in graphs -- a survey ⋮ Matchings and matching extensions in graphs ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness ⋮ Extending matchings in graphs: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching extension and the genus of a graph
• On n-extendable graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Paths, Trees, and Flowers
• On the structure of factorizable graphs

This page was built for publication: Toughness and matching extension in graphs