Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs

DOI10.1007/S00373-018-1987-4zbMath1431.05126OpenAlexW2902306738MaRDI QIDQ1733851

Taoye Zhang, Hong-Jian Lai, Mingquan Zhan, Ju Zhou

Publication date: 21 March 2019

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-018-1987-4

zbMATH Keywords

claw-free graphforbidden subgraphspancyclic graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• On a closure concept in claw-free graphs
• Pancyclicity of 4-connected \{claw, generalized bull\}-free graphs
• Every 3‐connected claw‐free Z ₈ ‐free graph is Hamiltonian
• Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs
• Hamiltonian results inK1,3-free graphs
• Pancyclicity of 4‐Connected, Claw‐Free, P₁₀‐Free Graphs

This page was built for publication: Pancyclicity of 4-connected \(\{K_{1,3},Z_8\}\)-free graphs