On Hamiltonian Walks in Graphs

DOI10.1137/0203017zbMath0269.05113OpenAlexW2089773331MaRDI QIDQ5686063

S. Goodman, Stephen T. Hedetniemi

Publication date: 1974

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0203017

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (10)

Grinberg's criterion ⋮ The diameter of the cube-connected cycles ⋮ The Hamiltonian Number of Cubic Graphs ⋮ Hamiltonian numbers in oriented graphs ⋮ The Hamiltonian numbers in digraphs ⋮ Hamiltonian spectra of graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs ⋮ ℓ-distant Hamiltonian walks in Cartesian product graphs ⋮ Hamiltonian Extension

This page was built for publication: On Hamiltonian Walks in Graphs