Binding number and toughness for matching extension

DOI10.1016/0012-365X(94)00175-5zbMath0837.05092MaRDI QIDQ1903741

Chuanping Chen

Publication date: 13 May 1996

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

zbMATH Keywords

matching1-factortoughnessmatching extensionnumber of componentsTutte's theorembinding numberneighbor set

Mathematics Subject Classification ID

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

Related Items (9)

Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs ⋮ Toughness, binding number and restricted matching extension in a graph ⋮ Matching extension and distance spectral radius ⋮ Matching extension and matching exclusion via the size or the spectral radius of graphs ⋮ Best monotone degree conditions for binding number ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Binding numbers and restricted fractional \(( g , f )\)-factors in graphs ⋮ Some results on binding number and fractional perfect matching ⋮ Matchings and matching extensions in graphs

Cites Work

• Toughness and matching extension in graphs
• Tough graphs and Hamiltonian circuits.
• The binding number of a graph and its Anderson number
• The Factorization of Linear Graphs

This page was built for publication: Binding number and toughness for matching extension