On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs

DOI10.3836/TJM/1233844061zbMath1208.05108OpenAlexW1968243230MaRDI QIDQ1012442

Shinya Fujita, Katsuhiro Ota, Yoshimi Egawa, Jun Fujisawa

Publication date: 21 April 2009

Published in: Tokyo Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3836/tjm/1233844061

zbMATH Keywords

2-factorminimum degreeforbidden subgraph

Mathematics Subject Classification ID

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

Related Items (3)

Forbidden pairs and \((k,m)\)-pancyclicity ⋮ Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian ⋮ Forbidden pairs and the existence of a dominating cycle

Cites Work

• Forbidden subgraphs that imply 2-factors
• Hamiltonicity in 3-connected claw-free graphs
• A note on Hamiltonian circuits
• On factors of 4-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A degree condition for the existence of regular factors inK1,n-free graphs

This page was built for publication: On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs