The existence of a 2-factor in K₁,n-free graphs with large connectivity and large edge-connectivity
DOI10.1002/JGT.20541zbMATH Open1230.05229OpenAlexW2042482359MaRDI QIDQ3174237FDOQ3174237
Authors: R. E. L. Aldred, Yoshimi Egawa, Jun Fujisawa, Katsuhiro Ota, Akira Saito 
Publication date: 12 October 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20541
Recommendations
- Regular factors in 2-connected \(K_{1,n}\)-free graphs
- Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
- A degree condition for the existence of regular factors inK1,n-free graphs
- scientific article; zbMATH DE number 1894980
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (13)
- On Hamiltonian properties of \(K_{1, r}\)-free split graphs
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs
- Local Dirac's condition on the existence of 2-factor
- Vizing's 2-factor conjecture involving toughness and maximum degree conditions
- Forbidden subgraphs and weak locally connected graphs
- 2- and 3-factors of graphs on surfaces
- On 2-factors in star-free graphs
- On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
- 4-factors in 2-connected star-free graphs
- On 2-factors with a bounded number of odd components
- Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
- Existence of 3-factors in \(K_{1,n}\)-free graphs with connectivity and edge-connectivity conditions
- Existence of 4-factors in star-free graphs with edge-connectivity conditions
This page was built for publication: The existence of a 2-factor in \(K_{1,n}\)-free graphs with large connectivity and large edge-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174237)
