forest

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