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 bipartite by a constant
- bounded bipartite does not imply bounded forest
- linear forest upper bounds forest by a constant
- bounded forest does not imply bounded linear forest
- forest upper bounds disjoint cycles by a constant
- bounded disjoint cycles does not imply bounded forest
- forest upper bounds block by a constant
- bounded block does not imply bounded forest
- stars upper bounds forest by a constant
- bounded forest does not imply bounded stars
- forest upper bounds distance to forest by a constant – by definition
- forest upper bounds feedback edge set by a constant
- bounded forest does not imply bounded girth
- bounded forest does not imply bounded distance to interval