forest
- 2017 Diestel2017
- page 13 : forest – An acyclic graph, one not containing any cycles, is called a \emph{forest}.
- unknown
- tree upper bounds forest by a constant – by definition
- forest upper bounds distance to forest by a constant – by definition
- forest upper bounds feedback edge set by a constant
- graph class forest has unbounded girth
- graph class forest has unbounded distance to interval
- assumed
- forest upper bounds bipartite by a constant
- graph class bipartite is not included in graph class forest
- linear forest upper bounds forest by a constant
- graph class forest is not included in graph class linear forest
- forest upper bounds disjoint cycles by a constant
- graph class disjoint cycles is not included in graph class forest
- forest upper bounds block by a constant
- graph class block is not included in graph class forest
- stars upper bounds forest by a constant
- graph class forest is not included in graph class stars