Almost Every Randomly Near-Traceable Graph has Diameter at Most Two

DOI10.1137/0401027MaRDI QIDQ3480092zbMATH OpenOpenAlexFDO

Authors Bing Zhou

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0401027

zbMATH Keywords

backtrackdepth-first searchdepth-first walkRandomly near-traceable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Randomly Near-Traceable Graphs
• The diameter of a random graph with bounded diameter
• On the diameter of a class of random graphs
• scientific article; zbMATH DE number 2147948
• scientific article; zbMATH DE number 3299382
• Diameters of random distance graphs
• Diameters of random circulant graphs
• A given diameter MST on a random graph
• On the diameter of random planar graphs

Cited in

(1)

• Randomly Near-Traceable Graphs

This page was built for publication: Almost Every Randomly Near-Traceable Graph has Diameter at Most Two

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