disjoint cycles
- unknown
- disjoint cycles – All cycles in the graph are disjoint. Can contain arbitrary trees attached to and between the cycles.
- disjoint cycles upper bounds outerplanar by a constant
- bounded outerplanar does not imply bounded disjoint cycles
- forest upper bounds disjoint cycles by a constant
- bounded disjoint cycles does not imply bounded forest
- cycles upper bounds disjoint cycles by a constant
- bounded disjoint cycles does not imply bounded cycles
- disjoint cycles upper bounds bisection bandwidth by a constant
- bounded disjoint cycles does not imply bounded girth
- bounded disjoint cycles does not imply bounded distance to perfect