Locally pancyclic graphs

DOI10.1006/jctb.1998.1885zbMath0929.05047OpenAlexW2086376513MaRDI QIDQ1305522

Ladislav Stacho

Publication date: 11 January 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1998.1885

zbMATH Keywords

degreepancyclichamiltonian

Mathematics Subject Classification ID

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

Related Items (5)

Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Cycles Embedding in Exchanged Crossed Cube ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A sufficient condition for pancyclability of graphs ⋮ A new sufficient condition for pancyclability of graphs

Cites Work

• Unnamed Item
• Cycles through specified vertices
• Hamiltonian degree conditions which imply a graph is pancyclic
• A cycle structure theorem for Hamiltonian graphs
• An Ore-type condition for pancyclability
• Pancyclism and bipancyclism of Hamiltonian graphs
• Parallel concepts in graph theory
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Pancyclic graphs. I
• On Hamilton's ideals
• Note on Hamilton Circuits
• Updating the hamiltonian problem—A survey
• Old Hamiltonian Ideas from a New Point of View

This page was built for publication: Locally pancyclic graphs