Small cycles in Hamiltonian graphs

DOI10.1016/S0166-218X(97)00043-7zbMATH Open0882.05082MaRDI QIDQ1372743FDOQ1372743

Ingo Schiermeyer, Uwe Schelten

Publication date: 2 March 1998

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

cyclespathpancyclicHamiltonian graph

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Note on Hamilton Circuits
• A method in graph theory
• Pancyclic graphs and a conjecture of Bondy and Chvatal
• Pancyclism and small cycles in graphs
• The complete closure of a graph

Cited In (8)

• Cycles in Hamiltonian graphs of prescribed maximum degree
• On the structure of the set of cycle lengths in a Hamiltonian graph
• Hamiltonian path saturated graphs with small size
• On Hamiltonian cycles and Hamiltonian paths
• Cycles in graphs with small density
• On the cycle spectrum of cubic Hamiltonian graphs
• Graph whose edges are in small cycles
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

This page was built for publication: Small cycles in Hamiltonian graphs

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