forest
equivalent to: forest
providers: ISGCI
Relations
| Other | Relation from | Relation to |
|---|---|---|
| acyclic chromatic number | exclusion | constant |
| arboricity | exclusion | constant |
| average degree | exclusion | constant |
| average distance | exclusion | unbounded |
| bandwidth | exclusion | unbounded |
| bipartite | exclusion | inclusion |
| bipartite number | exclusion | unknown to HOPS |
| bisection bandwidth | exclusion | constant |
| block | exclusion | inclusion |
| book thickness | exclusion | constant |
| boolean width | exclusion | constant |
| bounded components | exclusion | unbounded |
| boxicity | exclusion | constant |
| branch width | exclusion | constant |
| c-closure | exclusion | constant |
| carving-width | exclusion | unbounded |
| chordal | exclusion | inclusion |
| chordality | exclusion | constant |
| chromatic number | exclusion | constant |
| clique cover number | exclusion | unbounded |
| clique-tree-width | exclusion | constant |
| clique-width | exclusion | constant |
| cluster | exclusion | exclusion |
| co-cluster | exclusion | exclusion |
| cograph | exclusion | exclusion |
| complete | exclusion | exclusion |
| connected | exclusion | unknown to HOPS |
| cutwidth | exclusion | unbounded |
| cycle | unknown to HOPS | exclusion |
| cycles | exclusion | exclusion |
| d-path-free | exclusion | unbounded |
| degeneracy | exclusion | constant |
| degree treewidth | exclusion | unbounded |
| diameter | exclusion | unbounded |
| diameter+max degree | exclusion | unbounded |
| disjoint cycles | exclusion | inclusion |
| distance to bipartite | exclusion | constant |
| distance to block | exclusion | constant |
| distance to bounded components | exclusion | unbounded |
| distance to chordal | exclusion | constant |
| distance to cluster | exclusion | unbounded |
| distance to co-cluster | exclusion | unbounded |
| distance to cograph | exclusion | unbounded |
| distance to complete | exclusion | unbounded |
| distance to edgeless | exclusion | unbounded |
| distance to forest | exclusion | constant |
| distance to interval | exclusion | unbounded |
| distance to linear forest | exclusion | unbounded |
| distance to maximum degree | exclusion | unbounded |
| distance to outerplanar | exclusion | constant |
| distance to perfect | exclusion | constant |
| distance to planar | exclusion | constant |
| distance to stars | exclusion | unbounded |
| domatic number | exclusion | constant |
| domination number | exclusion | unbounded |
| edge clique cover number | exclusion | unbounded |
| edge connectivity | exclusion | constant |
| edgeless | inclusion | exclusion |
| feedback edge set | exclusion | constant |
| feedback vertex set | exclusion | constant |
| genus | exclusion | constant |
| girth | exclusion | unbounded |
| grid | exclusion | exclusion |
| h-index | exclusion | unbounded |
| inf-flip-width | exclusion | constant |
| interval | exclusion | exclusion |
| iterated type partitions | exclusion | unbounded |
| linear clique-width | exclusion | unknown to HOPS |
| linear forest | inclusion | exclusion |
| linear NLC-width | exclusion | unknown to HOPS |
| linear rank-width | exclusion | unknown to HOPS |
| maximum clique | exclusion | constant |
| maximum degree | exclusion | unbounded |
| maximum independent set | exclusion | unbounded |
| maximum induced matching | exclusion | unbounded |
| maximum leaf number | unknown to HOPS | unbounded |
| maximum matching | exclusion | unbounded |
| maximum matching on bipartite graphs | unknown to HOPS | unbounded |
| mim-width | exclusion | constant |
| minimum degree | exclusion | constant |
| mm-width | exclusion | constant |
| modular-width | exclusion | unbounded |
| module-width | exclusion | constant |
| neighborhood diversity | exclusion | unbounded |
| NLC-width | exclusion | constant |
| NLCT-width | exclusion | constant |
| odd cycle transversal | exclusion | constant |
| outerplanar | exclusion | inclusion |
| path | inclusion | exclusion |
| pathwidth | exclusion | unbounded |
| pathwidth+maxdegree | exclusion | unbounded |
| perfect | exclusion | inclusion |
| planar | exclusion | inclusion |
| radius-r flip-width | exclusion | constant |
| rank-width | exclusion | constant |
| shrub-depth | exclusion | unknown to HOPS |
| sim-width | exclusion | constant |
| star | inclusion | exclusion |
| stars | inclusion | exclusion |
| topological bandwidth | exclusion | unbounded |
| tree | inclusion | unknown to HOPS |
| tree-independence number | exclusion | constant |
| treedepth | exclusion | unbounded |
| treelength | exclusion | unknown to HOPS |
| treewidth | exclusion | constant |
| twin-cover number | exclusion | unbounded |
| twin-width | exclusion | constant |
| vertex connectivity | exclusion | unknown to HOPS |
| vertex cover | exclusion | unbounded |
| vertex integrity | exclusion | unbounded |
Results
- 2017 Graph Theory by Diestel
- page 13 : forest – An acyclic graph, one not containing any cycles, is called a \emph{forest}.
- unknown source
- 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
- graph class forest has constant distance to forest – by definition