Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Trémaux_tree> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Trémaux_tree abstract "In graph theory, a Trémaux tree of a 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.".
- Trémaux_tree thumbnail Undirected_graph.svg?width=300.
- Trémaux_tree wikiPageID "30247317".
- Trémaux_tree wikiPageRevisionID "582100962".
- Trémaux_tree subject Category:Graph_minor_theory.
- Trémaux_tree subject Category:Graph_theory_objects.
- Trémaux_tree subject Category:Infinite_graphs.
- Trémaux_tree subject Category:Spanning_tree.
- Trémaux_tree comment "In graph theory, a Trémaux tree of a 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.".
- Trémaux_tree label "Trémaux tree".
- Trémaux_tree sameAs Tr%C3%A9maux_tree.
- Trémaux_tree sameAs Q7849146.
- Trémaux_tree sameAs Q7849146.
- Trémaux_tree wasDerivedFrom Trémaux_tree?oldid=582100962.
- Trémaux_tree depiction Undirected_graph.svg.
