A degree condition for the existence of regular factors inK1,n-free graphs
From MaRDI portal
Publication:4879167
Recommendations
Cited in
(21)- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- 4-factors in 2-connected star-free graphs
- A degree condition for the existence of \([a,b]\)-factors in \(K_{1,n}\)-free graphs
- A degree condition for the existence of 1-factors in graphs or their complements
- A new degree condition for graphs to have \([a,b]\)-factor
- \(K_r\)-factors in graphs with low independence number
- A degree condition for fractional (g, f, n)-critical covered graphs
- Degree conditions for graphs to be fractional (a, b, n)-critical graphs
- A pair of forbidden subgraphs and 2-factors
- The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
- Regular factors in K1,n free graphs
- scientific article; zbMATH DE number 913257 (Why is no real title available?)
- Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
- Regular factors in 2-connected \(K_{1,n}\)-free graphs
- All regular multigraphs of even order and high degree are 1-factorable
- Remarks on component factors in K1,r-free graphs
- Sufficient conditions for a graph \(kG\) admitting all \([1, k]\)-factors
- Existence of 4-factors in star-free graphs with edge-connectivity conditions
- Sufficient conditions for even factors in graphs
- Signless Laplacian spectral conditions for even factors in graphs
- The existence of even factors based on the A_-spectral radius of graphs
This page was built for publication: A degree condition for the existence of regular factors inK1,n-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879167)