bipartite

• Diestel2017
  • page 17 : bipartite – Instead of `2-partite’ one usually says bipartite.
• unknown source
  • graph class bipartite has constant distance to bipartite – by definition
  • graph class bipartite has unbounded girth
  • graph class bipartite has unbounded edge connectivity
• assumed
  • graph class bipartite is included in graph class perfect
  • graph class perfect is not included in graph class bipartite
  • graph class forest is included in graph class bipartite
  • graph class bipartite is not included in graph class forest
  • graph class grid is included in graph class bipartite
  • graph class bipartite is not included in graph class grid
  • graphs with bounded maximum matching on bipartite graphs are included in graph class bipartite – by definition
• BodlaenderMohring1993
  • page 4 : graph class bipartite has unbounded treewidth – Lemma 3.2 (“complete bipartite subgraph containment lemma”).