The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity

DOI10.1002/jgt.20541zbMath1230.05229OpenAlexW2042482359MaRDI QIDQ3174237

Katsuhiro Ota, R. E. L. Aldred, Yoshimi Egawa, Akira Saito, Jun Fujisawa

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

zbMATH Keywords

2-factorminimum degree(edge-)connectivity\(K_{1,n}\)-free graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (10)

The Hamiltonian properties in \(K_{1,r}\)-free split graphs ⋮ Vizing's 2-factor conjecture involving toughness and maximum degree conditions ⋮ Unnamed Item ⋮ On Hamiltonian properties of \(K_{1, r}\)-free split graphs ⋮ Local Dirac's condition on the existence of 2-factor ⋮ Forbidden pairs of disconnected graphs for supereulerianity of connected graphs ⋮ On 2-factors with a bounded number of odd components ⋮ Forbidden subgraphs and weak locally connected graphs ⋮ 2- and 3-factors of graphs on surfaces ⋮ 4-factors in 2-connected star-free graphs

Cites Work

• 1-Factors and Antifactor Sets
• A degree condition for the existence of regular factors inK1,n-free graphs
• The Factors of Graphs

This page was built for publication: The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity