outerplanar
- 2017 Diestel2017
- 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 Bodlaender1998
- page 34 : outerplanar upper bounds treewidth by a constant – Lemma 78. Every outerplanar graph $G=(V,E)$ has treewidth at most 2.
- unknown
- outerplanar upper bounds planar by a constant
- bounded planar does not imply bounded outerplanar
- disjoint cycles upper bounds outerplanar by a constant
- bounded outerplanar does not imply bounded disjoint cycles
- outerplanar upper bounds distance to outerplanar by a constant – by definition
- outerplanar upper bounds bisection bandwidth by a constant