Assertion: graph's g | /r/HasProperty | normal tree
Facets:
Source sentences:
text: G is a normal tree if the ends of every edge in G are comparable in this tree-order whenever those ends are vertices of the tree (Diestel 2005, p. 15).
text: G is a normal tree if the ends of every edge in G are comparable in this tree-order whenever those ends are vertices of the tree.