Pancyclism in hamiltonian graphs

DOI10.1016/0012-365X(91)90361-5zbMATH Open0727.05039MaRDI QIDQ803159FDOQ803159

Authors: Denise Amar, Evelyne Flandrin, Irene Fournier, Anne Germa 

Publication date: 1991

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

zbMATH Keywords

nonbipartite graphpancyclic graph

Mathematics Subject Classification ID

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

Cites Work

• Pancyclic graphs. I
• Graph theory with applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ODD Cycles of Specified Length in Non-Bipartite Graphs
• Theory of path length distributions. I

Cited In (16)

• Pseudo-hamiltonian graphs
• Improved degree conditions for 2-factors with \(k\) cycles in Hamiltonian graphs
• Pancyclic arcs in Hamiltonian cycles of hypertournaments
• Hamiltonian degree conditions which imply a graph is pancyclic
• On 2-factors with \(k\) components
• A condition for a Hamiltonian bipartite graph to be bipancyclic
• Claw-free graphs---a survey
• Pancyclicity of claw-free Hamiltonian graphs
• Hamiltonicity in claw-free graphs
• A note on 2-factors with two components
• A sufficient condition for pancyclism of Hamiltonian graphs
• Pancyclicity of hamiltonian line graphs
• Weakly bipancyclic bipartite graphs
• Title not available (Why is that?)
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Pancyclicity when each cycle must pass exactly \(k\) Hamilton cycle chords

This page was built for publication: Pancyclism in hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803159)