Binding number and toughness for matching extension
From MaRDI portal
Publication:1903741
DOI10.1016/0012-365X(94)00175-5zbMath0837.05092MaRDI QIDQ1903741
Publication date: 13 May 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
matching; 1-factor; toughness; matching extension; number of components; Tutte's theorem; binding number; neighbor set
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Best monotone degree conditions for binding number, Matchings and matching extensions in graphs, Characterizing \(2k\)-critical graphs and \(n\)-extendable graphs, Some results on binding number and fractional perfect matching
Cites Work