Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs

DOI10.1016/j.disc.2021.112522zbMath1469.05098OpenAlexW3178227069MaRDI QIDQ2043390

Michael Santana, Timothy Morris, Michael Ferrara, James M. Carraher

Publication date: 2 August 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2021.112522

zbMATH Keywords

Hamiltonianclaw-free graphpancyclic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• On cycle lengths in claw-free graphs with complete closure
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs
• Forbidden subgraphs for chorded pancyclicity
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
• Hamiltonian results inK1,3-free graphs
• Critical graphs for subpancyclicity of 3-connected claw-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Pancyclicity of 4‐Connected, Claw‐Free, P₁₀‐Free Graphs
• Reflections on graph theory
• Claw-free graphs with complete closure