A degree condition for the existence of regular factors inK1,n-free graphs
From MaRDI portal
Publication:4879167
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199605)22:1<59::AID-JGT8>3.0.CO;2-K" /><59::AID-JGT8>3.0.CO;2-K 10.1002/(SICI)1097-0118(199605)22:1<59::AID-JGT8>3.0.CO;2-KzbMath0849.05058OpenAlexW4241166899MaRDI QIDQ4879167
Publication date: 8 July 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199605)22:1<59::aid-jgt8>3.0.co;2-k
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
A Pair of Forbidden Subgraphs and 2-Factors ⋮ A degree condition for fractional \((g, f, n)\)-critical covered graphs ⋮ The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity ⋮ Unnamed Item ⋮ Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs ⋮ A new degree condition for graphs to have \([a,b\)-factor] ⋮ On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs ⋮ 4-factors in 2-connected star-free graphs
This page was built for publication: A degree condition for the existence of regular factors inK1,n-free graphs
