A note on bounds for the maximum traceable number of a graph.

zbMATH Open1313.05089MaRDI QIDQ2936724FDOQ2936724

Authors: Futaba Fujie 

Publication date: 6 January 2015

Recommendations

• The upper traceable number of a graph
• On traceable and upper traceable numbers of graphs.
• Measures of traceability in graphs
• On upper traceable numbers of graphs
• scientific article; zbMATH DE number 5237274

zbMATH Keywords

traceable numberupper traceable numbermaximum traceable number

Mathematics Subject Classification ID

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

Cited In (6)

• Measures of traceability in graphs
• Lower bound for the size of maximal nontraceable graphs
• Title not available (Why is that?)
• The upper traceable number of a graph
• On upper traceable numbers of graphs
• Title not available (Why is that?)

This page was built for publication: A note on bounds for the maximum traceable number of a graph.

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