Assertion: graph | /r/HasProperty | forest
Facets:
value: exactly
type: DEGREE
Source sentences:
text: Every 1-degenerate graph is a forest.
text: The 2-colorable graphs are exactly the bipartite graphs, including trees and forests.
text: The graphs with exactly n − 1 {\displaystyle n-1} bridges are exactly the trees, and the graphs in which every edge is a bridge are exactly the forests.