distance to forest

Relations

Other		Relation from	Relation to
acyclic chromatic number	red■	exclusion	upper bound
arboricity	red■	exclusion	upper bound
average degree	red■	exclusion	upper bound
average distance	blue■	exclusion	exclusion
bandwidth	blue■	exclusion	exclusion
bipartite	blue■	unbounded	exclusion
bipartite number	magenta■	exclusion	unknown to HOPS
bisection bandwidth	blue■	exclusion	exclusion
block	blue■	unbounded	exclusion
book thickness	red■	exclusion	upper bound
boolean width	red■	exclusion	upper bound
bounded components	blue■	exclusion	exclusion
boxicity	red■	exclusion	upper bound
branch width	red■	exclusion	upper bound
c-closure	blue■	exclusion	exclusion
carving-width	blue■	exclusion	exclusion
chordal	blue■	unbounded	exclusion
chordality	red■	exclusion	upper bound
chromatic number	red■	exclusion	upper bound
clique cover number	blue■	exclusion	exclusion
clique-tree-width	red■	exclusion	upper bound
clique-width	red■	exclusion	upper bound
cluster	blue■	unbounded	exclusion
co-cluster	blue■	unbounded	exclusion
cograph	blue■	unbounded	exclusion
complete	blue■	unbounded	exclusion
connected	blue■	unbounded	exclusion
contraction complexity	blue■	exclusion	exclusion
cutwidth	blue■	exclusion	exclusion
cycle	green■	upper bound	exclusion
cycles	blue■	unbounded	exclusion
d-path-free	blue■	exclusion	exclusion
degeneracy	red■	exclusion	upper bound
degree treewidth	blue■	exclusion	exclusion
diameter	blue■	exclusion	exclusion
diameter+max degree	blue■	exclusion	exclusion
disconnected	gray■	unknown to HOPS	unknown to HOPS
disjoint cycles	blue■	unbounded	exclusion
distance to bipartite	red■	exclusion	upper bound
distance to block	red■	exclusion	upper bound
distance to bounded components	blue■	exclusion	exclusion
distance to chordal	red■	exclusion	upper bound
distance to cluster	blue■	exclusion	exclusion
distance to co-cluster	blue■	exclusion	exclusion
distance to cograph	blue■	exclusion	exclusion
distance to complete	blue■	exclusion	exclusion
distance to disconnected	red■	exclusion	upper bound
distance to edgeless	green■	upper bound	exclusion
distance to forest	yellow■	equal	equal
distance to interval	blue■	exclusion	exclusion
distance to linear forest	green■	upper bound	exclusion
distance to maximum degree	blue■	exclusion	exclusion
distance to outerplanar	red■	exclusion	upper bound
distance to perfect	red■	exclusion	upper bound
distance to planar	red■	exclusion	upper bound
distance to stars	green■	upper bound	exclusion
domatic number	red■	exclusion	upper bound
domination number	blue■	exclusion	exclusion
edge clique cover number	blue■	exclusion	exclusion
edge connectivity	red■	exclusion	upper bound
edgeless	green■	upper bound	exclusion
feedback edge set	green■	upper bound	exclusion
feedback vertex set	yellow■	equal	equal
forest	green■	upper bound	exclusion
genus	blue■	exclusion	exclusion
girth	blue■	exclusion	exclusion
grid	blue■	unbounded	exclusion
h-index	blue■	exclusion	exclusion
inf-flip-width	red■	exclusion	upper bound
interval	blue■	unbounded	exclusion
iterated type partitions	blue■	exclusion	exclusion
linear clique-width	magenta■	exclusion	unknown to HOPS
linear forest	green■	upper bound	exclusion
linear NLC-width	magenta■	exclusion	unknown to HOPS
linear rank-width	magenta■	exclusion	unknown to HOPS
maximum clique	red■	exclusion	upper bound
maximum degree	blue■	exclusion	exclusion
maximum independent set	blue■	exclusion	exclusion
maximum induced matching	blue■	exclusion	exclusion
maximum leaf number	green■	upper bound	exclusion
maximum matching	green■	upper bound	exclusion
maximum matching on bipartite graphs	green■	upper bound	exclusion
mim-width	red■	exclusion	upper bound
minimum degree	red■	exclusion	upper bound
mm-width	red■	exclusion	upper bound
modular-width	blue■	exclusion	exclusion
module-width	red■	exclusion	upper bound
neighborhood diversity	blue■	exclusion	exclusion
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
odd cycle transversal	red■	exclusion	upper bound
outerplanar	blue■	unbounded	exclusion
path	green■	upper bound	exclusion
pathwidth	blue■	exclusion	exclusion
pathwidth+maxdegree	blue■	exclusion	exclusion
perfect	blue■	unbounded	exclusion
planar	blue■	unbounded	exclusion
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
shrub-depth	magenta■	exclusion	unknown to HOPS
sim-width	red■	exclusion	upper bound
size	green■	upper bound	exclusion
star	green■	upper bound	exclusion
stars	green■	upper bound	exclusion
topological bandwidth	blue■	exclusion	exclusion
tree	green■	upper bound	exclusion
tree-independence number	red■	exclusion	upper bound
treedepth	blue■	exclusion	exclusion
treelength	magenta■	exclusion	unknown to HOPS
treewidth	red■	exclusion	upper bound
twin-cover number	blue■	exclusion	exclusion
twin-width	red■	exclusion	upper bound
vertex connectivity	red■	exclusion	upper bound
vertex cover	green■	upper bound	exclusion
vertex integrity	blue■	exclusion	exclusion

Results

unknown source
- feedback vertex set is equivalent to distance to forest
- distance to forest is equivalent to feedback vertex set
assumed
- forest upper bounds distance to forest by a constant – by definition
- distance to forest is equivalent to distance to forest – assumed