On upper traceable numbers of graphs

DOI10.21136/MB.2008.140628MaRDI QIDQ3392742zbMATH OpenOpenAlexFDO

Authors Futaba Okamoto, Ping Zhang

Publication date 17 August 2009

Full work available at URL https://eudml.org/doc/38063, http://www.emis.de/journals/MB/133.4/index.html

zbMATH Keywords

traceable graphtraceable numberupper traceable number

Mathematics Subject Classification ID

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

Recommendations

• On traceable and upper traceable numbers of graphs.
• A note on bounds for the maximum traceable number of a graph.
• The upper traceable number of a graph
• scientific article; zbMATH DE number 5994568
• Domination number and traceability of graphs
• scientific article; zbMATH DE number 5237274
• Upper embeddability of graphs
• On the fixatic number of graphs.
• scientific article; zbMATH DE number 4012641
• The upper domatic number of powers of graphs

Cited in

(5)

• On traceable and upper traceable numbers of graphs.
• A note on bounds for the maximum traceable number of a graph.
• Measures of traceability in graphs
• The upper traceable number of a graph
• scientific article; zbMATH DE number 5237274 (Why is no real title available?)

This page was built for publication: On upper traceable numbers of graphs

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