Pancyclism in hamiltonian graphs

DOI10.1016/0012-365X(91)90361-5zbMath0727.05039MaRDI QIDQ803159

Anne Germa, Denise Amar, Evelyne Flandrin, Irene Fournier

Publication date: 1991

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

zbMATH Keywords

nonbipartite graphpancyclic graph

Mathematics Subject Classification ID

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

Related Items

Claw-free graphs---a survey ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs ⋮ Weakly bipancyclic bipartite graphs ⋮ Hamiltonicity in claw-free graphs ⋮ A condition for a Hamiltonian bipartite graph to be bipancyclic ⋮ On 2-factors with \(k\) components ⋮ Pancyclicity of claw-free Hamiltonian graphs ⋮ Pancyclicity of hamiltonian line graphs ⋮ A note on 2-factors with two components

Cites Work

• Pancyclic graphs. I
• Theory of path length distributions. I
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pancyclism in hamiltonian graphs