BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
From MaRDI portal
Publication:3781142
DOI10.1093/qmath/38.2.221zbMath0639.05050MaRDI QIDQ3781142
Douglas R. Woodall, P. Katerinis
Publication date: 1987
Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qmath/38.2.221
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C99: Graph theory
Related Items
Notes on the binding numbers for (a, b, k)-critical graphs, A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs, Binding numbers and connected factors, Best monotone degree conditions for binding number, Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor], Graph factors and factorization: 1985--2003: a survey, On fractional \((f,n)\)-critical graphs, The stability number and connected \([k,k+1\)-factor in graphs], Binding number and minimum degree for the existence of \((g,f,n)\)-critical graphs, Degree and stability number condition for the existence of connected factors in graphs, An Ore-type condition for the existence of \(k\)-factors in graphs, Binding numbers and \(f\)-factors of graphs, Connected \([k,k+1\)-factors of graphs], Minimum degree, independence number and regular factors
