Depth-first search as a combinatorial correspondence (Q754887)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Depth-first search as a combinatorial correspondence |
scientific article; zbMATH DE number 3648738
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-first search as a combinatorial correspondence |
scientific article; zbMATH DE number 3648738 |
Statements
Depth-first search as a combinatorial correspondence (English)
0 references
1979
0 references
enumerator
0 references
graphs
0 references
trees
0 references
depth-first search
0 references
spanning tree
0 references
connected graph
0 references
directed graphs
0 references
tournaments
0 references
Tutte polynomial
0 references
spanning forests
0 references
