The upper traceable number of a graph

DOI10.1007/S10587-008-0016-9MaRDI QIDQ3624883zbMATH OpenOpenAlexFDO

Authors Futaba Okamoto, Ping Zhang, Varaporn Saenpholphat

Publication date 6 May 2009

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/31210, http://hdl.handle.net/10338.dmlcz/128257

zbMATH Keywords

Hamiltonian numbertraceable numberupper traceable number

Mathematics Subject Classification ID

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

Recommendations

• On upper traceable numbers of graphs
• A note on bounds for the maximum traceable number of a graph.
• On traceable and upper traceable numbers of graphs.
• Measures of traceability in graphs
• scientific article; zbMATH DE number 5237274

Cites work

• A generalization of Hamiltonian cycles for trees
• An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs
• An upper bound on the length of a Hamiltonian walk of a maximal planar graph
• Graphs with prescribed order and Hamiltonian number
• scientific article; zbMATH DE number 95322 (Why is no real title available?)
• scientific article; zbMATH DE number 3501535 (Why is no real title available?)
• scientific article; zbMATH DE number 2077679 (Why is no real title available?)
• scientific article; zbMATH DE number 2141600 (Why is no real title available?)
• scientific article; zbMATH DE number 2109324 (Why is no real title available?)
• Measures of traceability in graphs

Cited in

(6)

• On the Hamiltonian number of a plane graph
• Radio labelings of distance graphs
• On traceable and upper traceable numbers of graphs.
• A note on bounds for the maximum traceable number of a graph.
• On upper traceable numbers of graphs
• Measures of traceability in graphs

This page was built for publication: The upper traceable number of a graph

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