Assertion: graph's g | /r/HasProperty | tree
Facets:
value: with more than two vertices
type: OTHER
Source sentences:
text: If G is a tree, then G itself is the universal covering graph of G.
text: Trees are a special case of bipartite graphs, and testing whether a tree is well-covered can be handled as a much simpler special case of the characterization of well-covered bipartite graphs: if G is a tree with more than two vertices, it is well-covered if and only if each non-leaf node of the tree is adjacent to exactly one leaf.