The hidden algorithm of Ore's theorem on Hamiltonian cycles

DOI10.1016/S0898-1221(97)00225-3zbMath0902.05067OpenAlexW2033314055MaRDI QIDQ1388983

Edgar M. Palmer

Publication date: 2 December 1998

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(97)00225-3

zbMATH Keywords

graph algorithmrandom graphshamiltonian cycle

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Edge disjoint caterpillar realizations ⋮ Selecting and covering colored points

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian circuits in random graphs
• Note on Hamilton Circuits
• For How Many Edges is a Graph Almost Certainly Hamiltonian?
• Some Theorems on Abstract Graphs

This page was built for publication: The hidden algorithm of Ore's theorem on Hamiltonian cycles