Trémaux tree
In graph theory, a Trémaux tree of an undirected graph G is a spanning tree of G, rooted at one of its vertices, with the property that every two adjacent vertices in G are related to each other as an ancestor and descendant in the tree. All depth-first search trees and all Hamiltonian paths are Trémaux trees.Trémaux trees are named after Charles Pierre Trémaux, a 19th-century French author who used a form of depth-first search as a strategy for solving mazes. They have also been called normal spanning trees, especially in the context of infinite graphs.
Wikipage redirect
sameAs
primaryTopic
Trémaux tree
In graph theory, a Trémaux tree of an undirected graph G is a spanning tree of G, rooted at one of its vertices, with the property that every two adjacent vertices in G are related to each other as an ancestor and descendant in the tree. All depth-first search trees and all Hamiltonian paths are Trémaux trees.Trémaux trees are named after Charles Pierre Trémaux, a 19th-century French author who used a form of depth-first search as a strategy for solving mazes. They have also been called normal spanning trees, especially in the context of infinite graphs.
has abstract
In graph theory, a Trémaux tre ...... r each end, are metric spaces.
@en
thumbnail
Wikipage page ID
30,247,317
Wikipage revision ID
743,290,612
comment
In graph theory, a Trémaux tre ...... he context of infinite graphs.
@en
label
Trémaux tree
@en