cograph

• 2021/11 twinWidthI2021
  • cograph is equal to reduced edgeless
• 1994 Wanke1994
  • page 5 : cograph upper bounds NLC-width by a constant – Fact 2.3. $G$ is a $1$-NLC graph if and only if $unlab(G)$ is a co-graph.
• assumed
  • cograph upper bounds perfect by a constant
  • graph class perfect is not included in graph class cograph
  • co-cluster upper bounds cograph by a constant
  • graph class cograph is not included in graph class co-cluster
• unknown
  • cograph upper bounds distance to cograph by a constant – by definition