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 bisection bandwidth by a constant
  • graph class disjoint cycles has unbounded girth
  • graph class disjoint cycles has unbounded distance to perfect
• assumed
  • disjoint cycles upper bounds outerplanar by a constant
  • graph class outerplanar is not included in graph class disjoint cycles
  • forest upper bounds disjoint cycles by a constant
  • graph class disjoint cycles is not included in graph class forest
  • cycles upper bounds disjoint cycles by a constant
  • graph class disjoint cycles is not included in graph class cycles