Generalized pancyclic properties in claw-free graphs

DOI10.1007/s00373-014-1510-5zbMath1327.05173OpenAlexW1978201842MaRDI QIDQ897272

Charles Brian Crane

Publication date: 17 December 2015

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

Full work available at URL: https://doi.org/10.1007/s00373-014-1510-5

zbMATH Keywords

cycleHamiltoniandegree sumpancyclicforbidden subgraphclaw-free

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Forbidden pairs and \((k,m)\)-pancyclicity ⋮ Hamiltonian type properties in claw-free \(P_5\)-free graphs ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Generalizing pancyclic and \(k\)-ordered graphs
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
• Pancyclic graphs. I
• Note on Hamilton Circuits
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized pancyclic properties in claw-free graphs