Almost Every Randomly Near-Traceable Graph has Diameter at Most Two (Q3480092)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Almost Every Randomly Near-Traceable Graph has Diameter at Most Two |
scientific article |
Statements
Almost Every Randomly Near-Traceable Graph has Diameter at Most Two (English)
0 references
1988
0 references
depth-first walk
0 references
backtrack
0 references
Randomly near-traceable graphs
0 references
depth-first search
0 references
