Pancyclism in hamiltonian graphs
From MaRDI portal
Publication:803159
Cites work
- scientific article; zbMATH DE number 3902696 (Why is no real title available?)
- scientific article; zbMATH DE number 3762094 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Graph theory with applications
- ODD Cycles of Specified Length in Non-Bipartite Graphs
- Pancyclic graphs. I
- Theory of path length distributions. I
Cited in
(16)- Improved degree conditions for 2-factors with k cycles in Hamiltonian graphs
- Pseudo-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
- scientific article; zbMATH DE number 6692111 (Why is no real title available?)
- 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)