distance to outerplanar

providers: ISGCI

Definition: Minimum number of vertices removed to make the graph into outerplanar

Relations

Other		Relation from	Relation to
acyclic chromatic number	red■	exclusion	upper bound
admissibility	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	blue■	exclusion	exclusion
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
bounded expansion	red■	exclusion	upper bound
boxicity	red■	exclusion	upper bound
branch width	red■	exclusion	upper bound
c-closure	blue■	exclusion	exclusion
carving-width	blue■	exclusion	exclusion
chi-bounded	red■	exclusion	upper bound
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■	exclusion	avoids
contraction complexity	blue■	exclusion	exclusion
cutwidth	blue■	exclusion	exclusion
cycle	green■	upper bound	exclusion
cycles	cyan■	unknown to HOPS	exclusion
d-admissibility	red■	exclusion	upper bound
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
distance to bipartite	blue■	exclusion	exclusion
distance to block	blue■	exclusion	exclusion
distance to bounded components	blue■	exclusion	exclusion
distance to chordal	blue■	exclusion	exclusion
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 edgeless	green■	upper bound	exclusion
distance to forest	green■	upper bound	exclusion
distance to interval	blue■	exclusion	exclusion
distance to linear forest	green■	upper bound	exclusion
distance to maximum degree	blue■	exclusion	exclusion
distance to outerplanar	yellow■	equal	equal
distance to perfect	blue■	exclusion	exclusion
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
domino treewidth	blue■	exclusion	exclusion
edge clique cover number	blue■	exclusion	exclusion
edge connectivity	red■	exclusion	upper bound
edge-cut width	gray■	unknown to HOPS	unknown to HOPS
edge-treewidth	magenta■	exclusion	unknown to HOPS
edgeless	green■	upper bound	avoids
excluded minor	magenta■	exclusion	unknown to HOPS
excluded planar minor	gray■	unknown to HOPS	unknown to HOPS
excluded top-minor	red■	exclusion	upper bound
feedback edge set	green■	upper bound	exclusion
feedback vertex set	green■	upper bound	exclusion
flip-width	red■	exclusion	upper bound
forest	green■	upper bound	exclusion
genus	blue■	exclusion	exclusion
grid	blue■	unbounded	exclusion
h-index	blue■	exclusion	exclusion
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
merge-width	red■	exclusion	upper bound
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
monadically dependent	red■	exclusion	upper bound
monadically stable	red■	exclusion	upper bound
neighborhood diversity	blue■	exclusion	exclusion
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
nowhere dense	red■	exclusion	upper bound
odd cycle transversal	blue■	exclusion	exclusion
outerplanar	green■	upper bound	exclusion
overlap treewidth	magenta■	exclusion	unknown to HOPS
path	green■	upper bound	exclusion
pathwidth	blue■	exclusion	exclusion
pathwidth+maxdegree	blue■	exclusion	exclusion
perfect	blue■	unbounded	exclusion
planar	blue■	unbounded	exclusion
radius-inf flip-width	red■	exclusion	upper bound
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
series-parallel	gray■	unknown to HOPS	unknown to HOPS
shrub-depth	magenta■	exclusion	unknown to HOPS
sim-width	red■	exclusion	upper bound
size	green■	upper bound	exclusion
slim tree-cut width	magenta■	exclusion	unknown to HOPS
sparse twin-width	red■	exclusion	upper bound
star	green■	upper bound	exclusion
stars	green■	upper bound	exclusion
strong coloring number	red■	exclusion	upper bound
strong d-coloring number	red■	exclusion	upper bound
strong inf-coloring number	red■	exclusion	upper bound
topological bandwidth	blue■	exclusion	exclusion
tree	green■	upper bound	exclusion
tree-cut width	magenta■	exclusion	unknown to HOPS
tree-independence number	red■	exclusion	upper bound
tree-partition-width	magenta■	exclusion	unknown to HOPS
treebandwidth	magenta■	exclusion	unknown to HOPS
treedepth	blue■	exclusion	exclusion
treelength	magenta■	exclusion	unknown to HOPS
treespan	blue■	exclusion	exclusion
treewidth	red■	exclusion	upper bound
twin-cover number	blue■	exclusion	exclusion
twin-width	red■	exclusion	upper bound
vertex connectivity	gray■	unknown to HOPS	unknown to HOPS
vertex cover	green■	upper bound	exclusion
vertex integrity	blue■	exclusion	exclusion
weak coloring number	red■	exclusion	upper bound
weak d-coloring number	red■	exclusion	upper bound
weak inf-coloring number	blue■	exclusion	exclusion
weakly sparse	red■	exclusion	upper bound
weakly sparse and merge width	red■	exclusion	upper bound

Results

Comparing Graph Parameters by Schröder
- page 26 : graph classes with bounded distance to outerplanar are not bounded distance to perfect – Proposition 3.23
assumed
- outerplanar upper bounds distance to outerplanar by a constant – by definition
- distance to outerplanar is equivalent to distance to outerplanar – assumed
unknown source
- distance to outerplanar upper bounds treewidth by a linear function – After removal of $k$ vertices the remaining class has a bounded width $w$. So by including the removed vertices in every bag, we can achieve decomposition of width $w+k$
- feedback vertex set upper bounds distance to outerplanar by a computable function