A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1

MaRDI QIDQ3429554zbMATH OpenFDO

Authors Futaba Okamoto, Ping Zhang

Publication date 2 April 2007

zbMATH Keywords

traceable

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12)

Recommendations

• A note on vertex-covering walks
• scientific article; zbMATH DE number 2077679
• scientific article; zbMATH DE number 2109324
• Graphs with prescribed order and Hamiltonian number
• Upper Hamiltonian numbers and Hamiltonian spectra of graphs

Cited in

(1)

• A note on vertex-covering walks

This page was built for publication: A characterization of graphs whose Hamiltonian and upper Hamiltonian numbers differ by 1

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