k -Factors and Neighbourhoods of Independent Sets in Graphs
From MaRDI portal
Publication:3808124
DOI10.1112/jlms/s2-41.3.385zbMath0659.05070OpenAlexW2058696776MaRDI QIDQ3808124
Publication date: 1990
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-41.3.385
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Discussion on fractional \((a, b, k)\)-critical covered graphs, Minimum degree, independence number and regular factors, Graph factors and factorization: 1985--2003: a survey, NEIGHBOURHOODS OF INDEPENDENT SETS FOR (a,b,k)-CRITICAL GRAPHS, Best monotone degree conditions for graph properties: a survey, Binding numbers and \(f\)-factors of graphs, NEIGHBOURHOOD AND THE EXISTENCE OF FRACTIONAL k-FACTORS OF GRAPHS, Binding number and minimum degree for k-factors, Remarks on fractional ID-\(k\)-factor-critical graphs, Triangles and neighbourhoods of independent sets in graphs