bn:02379443n
Noun Concept
SYL
No term available
EN
In graph theory, a Trémaux tree of an undirected graph G {\displaystyle G} is a type of spanning tree, generalizing depth-first search trees. Wikipedia
Relations
Sources