Skip to search formSkip to main contentSkip to account menu

Trémaux tree

Known as: Charles Trémaux, Charles Pierre Trémaux, Tremaux 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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Results of an investigation of radial growth of Larix cajanderi Mayr and Pinus sylvestris L. in Central Yakutia are presented… 
Highly Cited
2009
Highly Cited
2009
Because of the characteristically low temperatures and ambient CO2 concentrations associated with greater altitudes, mountain… 
Highly Cited
2006
Highly Cited
2006
We present a simplified version of the DFS-based Left-Right planarity testing and embedding algorithm implemented in Pigale [1, 2… 
2006
2006
  • R. Diestel
  • 2006
  • Corpus ID: 37756884
2002
2002
In the Central Highlands on Kenya, Grevillearobusta (A. Cunn.) trees are commonly planted on maize (Zeamays L.) fields. This type… 
2001
2001
It is proved that a connected infinite graph has a normal spanning tree (the infinite analogue of a depth‐first search tree) if… 
1994
1994
A well-founded tree T defined on the vertex set of a graph G is called normal if the endvertices of any edge of G are comparable… 
Review
1985
Review
1985
Twenty-eight worldwide reports of massive mangrove tree mortalities are reviewed. Massive mortality is defined as tree… 
1983
1983
  • A. Shigo
  • 1983
  • Corpus ID: 208896724
Proper tree care starts with a thorough understanding of trees and the many treatments used to help trees stay attractive, safe…