disjoint cycles

• unknown source
  • disjoint cycles – All cycles in the graph are disjoint. Can contain arbitrary trees attached to and between the cycles.
  • graph class disjoint cycles has constant bisection bandwidth
  • graph class disjoint cycles has unbounded girth
• assumed
  • graph class disjoint cycles is included in graph class outerplanar
  • graph class outerplanar is not included in graph class disjoint cycles
  • graph class forest is included in graph class disjoint cycles
  • graph class disjoint cycles is not included in graph class forest
  • graph class cycles is included in graph class disjoint cycles
  • graph class disjoint cycles is not included in graph class cycles