outerplanar

providers: ISGCI

Definition: A planar graph that can be drawin in a way where one face is incident to all the vertices.

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	magenta■	exclusion	unknown to HOPS
bandwidth	magenta■	exclusion	unknown to HOPS
bipartite	magenta■	exclusion	unknown to HOPS
bipartite number	magenta■	exclusion	unknown to HOPS
bisection bandwidth	red■	exclusion	upper bound
block	magenta■	exclusion	unknown to HOPS
book thickness	red■	exclusion	upper bound
boolean width	red■	exclusion	upper bound
bounded components	magenta■	exclusion	unknown to HOPS
bounded expansion	red■	exclusion	upper bound
boxicity	red■	exclusion	upper bound
branch width	red■	exclusion	upper bound
c-closure	magenta■	exclusion	unknown to HOPS
carving-width	magenta■	exclusion	unknown to HOPS
chi-bounded	red■	exclusion	upper bound
chordal	magenta■	exclusion	unknown to HOPS
chordality	red■	exclusion	upper bound
chromatic number	red■	exclusion	upper bound
clique cover number	magenta■	exclusion	unknown to HOPS
clique-tree-width	red■	exclusion	upper bound
clique-width	red■	exclusion	upper bound
cluster	magenta■	exclusion	unknown to HOPS
co-cluster	magenta■	exclusion	unknown to HOPS
cograph	magenta■	exclusion	unknown to HOPS
complete	magenta■	exclusion	unknown to HOPS
connected	magenta■	exclusion	unknown to HOPS
contraction complexity	magenta■	exclusion	unknown to HOPS
cutwidth	magenta■	exclusion	unknown to HOPS
cycle	gray■	unknown to HOPS	unknown to HOPS
cycles	gray■	unknown to HOPS	unknown to HOPS
d-admissibility	red■	exclusion	upper bound
d-path-free	magenta■	exclusion	unknown to HOPS
degeneracy	red■	exclusion	upper bound
degree treewidth	magenta■	exclusion	unknown to HOPS
diameter	magenta■	exclusion	unknown to HOPS
diameter+max degree	magenta■	exclusion	unknown to HOPS
distance to bipartite	magenta■	exclusion	unknown to HOPS
distance to block	magenta■	exclusion	unknown to HOPS
distance to bounded components	magenta■	exclusion	unknown to HOPS
distance to chordal	magenta■	exclusion	unknown to HOPS
distance to cluster	magenta■	exclusion	unknown to HOPS
distance to co-cluster	magenta■	exclusion	unknown to HOPS
distance to cograph	magenta■	exclusion	unknown to HOPS
distance to complete	magenta■	exclusion	unknown to HOPS
distance to edgeless	magenta■	exclusion	unknown to HOPS
distance to forest	magenta■	exclusion	unknown to HOPS
distance to interval	magenta■	exclusion	unknown to HOPS
distance to linear forest	magenta■	exclusion	unknown to HOPS
distance to maximum degree	magenta■	exclusion	unknown to HOPS
distance to outerplanar	red■	exclusion	upper bound
distance to perfect	magenta■	exclusion	unknown to HOPS
distance to planar	red■	exclusion	upper bound
distance to stars	magenta■	exclusion	unknown to HOPS
domatic number	red■	exclusion	upper bound
domination number	magenta■	exclusion	unknown to HOPS
domino treewidth	magenta■	exclusion	unknown to HOPS
edge clique cover number	magenta■	exclusion	unknown to HOPS
edge connectivity	red■	exclusion	upper bound
edge-cut width	magenta■	exclusion	unknown to HOPS
edge-treewidth	magenta■	exclusion	unknown to HOPS
edgeless	gray■	unknown to HOPS	unknown to HOPS
excluded minor	red■	exclusion	upper bound
excluded planar minor	orange■	unknown to HOPS	upper bound
excluded top-minor	red■	exclusion	upper bound
feedback edge set	magenta■	exclusion	unknown to HOPS
feedback vertex set	magenta■	exclusion	unknown to HOPS
flip-width	red■	exclusion	upper bound
forest	gray■	unknown to HOPS	unknown to HOPS
genus	red■	exclusion	upper bound
grid	magenta■	exclusion	unknown to HOPS
h-index	magenta■	exclusion	unknown to HOPS
interval	magenta■	exclusion	unknown to HOPS
iterated type partitions	magenta■	exclusion	unknown to HOPS
linear clique-width	magenta■	exclusion	unknown to HOPS
linear forest	gray■	unknown to HOPS	unknown to HOPS
linear NLC-width	magenta■	exclusion	unknown to HOPS
linear rank-width	magenta■	exclusion	unknown to HOPS
maximum clique	red■	exclusion	upper bound
maximum degree	magenta■	exclusion	unknown to HOPS
maximum independent set	magenta■	exclusion	unknown to HOPS
maximum induced matching	magenta■	exclusion	unknown to HOPS
maximum leaf number	magenta■	exclusion	unknown to HOPS
maximum matching	magenta■	exclusion	unknown to HOPS
maximum matching on bipartite graphs	gray■	unknown to HOPS	unknown to HOPS
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	magenta■	exclusion	unknown to HOPS
module-width	red■	exclusion	upper bound
monadically dependent	red■	exclusion	upper bound
monadically stable	red■	exclusion	upper bound
neighborhood diversity	magenta■	exclusion	unknown to HOPS
NLC-width	red■	exclusion	upper bound
NLCT-width	red■	exclusion	upper bound
nowhere dense	red■	exclusion	upper bound
odd cycle transversal	magenta■	exclusion	unknown to HOPS
outerplanar	yellow■	equal	equal
overlap treewidth	magenta■	exclusion	unknown to HOPS
path	gray■	unknown to HOPS	unknown to HOPS
pathwidth	magenta■	exclusion	unknown to HOPS
pathwidth+maxdegree	magenta■	exclusion	unknown to HOPS
perfect	magenta■	exclusion	unknown to HOPS
planar	red■	exclusion	inclusion
radius-inf flip-width	red■	exclusion	upper bound
radius-r flip-width	red■	exclusion	upper bound
rank-width	red■	exclusion	upper bound
series-parallel	red■	exclusion	inclusion
shrub-depth	magenta■	exclusion	unknown to HOPS
sim-width	red■	exclusion	upper bound
size	magenta■	exclusion	unknown to HOPS
slim tree-cut width	magenta■	exclusion	unknown to HOPS
sparse twin-width	red■	exclusion	upper bound
star	gray■	unknown to HOPS	unknown to HOPS
stars	gray■	unknown to HOPS	unknown to HOPS
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	magenta■	exclusion	unknown to HOPS
tree	gray■	unknown to HOPS	unknown to HOPS
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	magenta■	exclusion	unknown to HOPS
treelength	magenta■	exclusion	unknown to HOPS
treespan	magenta■	exclusion	unknown to HOPS
treewidth	red■	exclusion	upper bound
twin-cover number	magenta■	exclusion	unknown to HOPS
twin-width	red■	exclusion	upper bound
vertex connectivity	gray■	unknown to HOPS	unknown to HOPS
vertex cover	magenta■	exclusion	unknown to HOPS
vertex integrity	magenta■	exclusion	unknown to HOPS
weak coloring number	red■	exclusion	upper bound
weak d-coloring number	red■	exclusion	upper bound
weak inf-coloring number	magenta■	exclusion	unknown to HOPS
weakly sparse	red■	exclusion	upper bound
weakly sparse and merge width	red■	exclusion	upper bound

Results

2017 Graph Theory by Diestel
- page 115 : outerplanar – A graph is called outerplanar if it has a drawing in which every vertex lies on the boundary of the outer face.
1998 A partial $k$-arboretum of graphs with bounded treewidth by Bodlaender
- page 34 : outerplanar upper bounds treewidth by a constant – Lemma 78. Every outerplanar graph $G=(V,E)$ has treewidth at most 2.
unknown source
- outerplanar upper bounds excluded planar minor by a constant
- outerplanar upper bounds bisection bandwidth by a constant
assumed
- graph class outerplanar has contained in planar
- graph class planar does not have contained in outerplanar
- graph class outerplanar has contained in series-parallel
- graph class series-parallel does not have contained in outerplanar
- outerplanar upper bounds distance to outerplanar by a constant – by definition
- outerplanar is equivalent to outerplanar – assumed