On Hamiltonian Walks in Graphs

DOI10.1137/0203017MaRDI QIDQ5686063zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(12)

• Grinberg's criterion
• Hamiltonian numbers in oriented graphs
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• The Hamiltonian numbers in digraphs
• Hamiltonian spectra of graphs
• -distant Hamiltonian walks in Cartesian product graphs
• The diameter of the cube-connected cycles
• The Hamiltonian Number of Cubic Graphs
• Hamiltonian extension
• Graph theory (algorithmic, algebraic, and metric problems)
• Combinatorial spectra using polynomials.
• On reduced Hamilton walks

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

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