Hamiltonian type properties in claw-free \(P_5\)-free graphs

DOI10.1007/s00373-016-1680-4zbMath1351.05125OpenAlexW2272731928MaRDI QIDQ343731

Charles Brian Crane

Publication date: 29 November 2016

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

Full work available at URL: https://doi.org/10.1007/s00373-016-1680-4

zbMATH Keywords

cycleHamiltonianpathclaw-free graphpancyclicforbidden subgraph

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Characterizing the difference between graph classes defined by forbidden pairs including the claw ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizing pancyclic and \(k\)-ordered graphs
• Generalized pancyclic properties in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• Pancyclic graphs. I
• Note on Hamilton Circuits

This page was built for publication: Hamiltonian type properties in claw-free \(P_5\)-free graphs