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 in T. We study how normal trees can be used to describe the structure ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback