BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
From MaRDI portal
Publication:3781142
DOI10.1093/QMATH/38.2.221zbMath0639.05050OpenAlexW2090242643MaRDI QIDQ3781142
P. Katerinis, Douglas R. Woodall
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (23)
Connected \([k,k+1\)-factors of graphs] ⋮ Minimum degree, independence number and regular factors ⋮ Path factors in subgraphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Binding numbers and connected factors ⋮ Two Sufficient Conditions for Graphs to Admit Path Factors ⋮ A sufficient condition for the existence of a k-factor excluding a given r-factor ⋮ Some existence theorems on path factors with given properties in graphs ⋮ Binding number, \(k\)-factor and spectral radius of graphs ⋮ Best monotone degree conditions for binding number ⋮ Binding numbers and \([a,b\)-factors excluding a given \(k\)-factor] ⋮ Binding numbers for fractional ID-\(k\)-factor-critical graphs ⋮ Research on fractional critical covered graphs ⋮ An Ore-type condition for the existence of \(k\)-factors in graphs ⋮ Best monotone degree conditions for graph properties: a survey ⋮ Binding numbers and \(f\)-factors of graphs ⋮ A sufficient condition for graphs to be fractional \((k,m)\)-deleted graphs ⋮ Notes on the binding numbers for (a, b, k)-critical graphs ⋮ 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 ⋮ Some results about component factors in graphs
This page was built for publication: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
