OurBigBook Wikipedia Bot Documentation
A trivially perfect graph is a special type of graph characterized by its cliques and independent sets. Specifically, a graph \( G \) is defined as trivially perfect if every induced subgraph of \( G \) has a clique that is also a maximum independent set.

Ancestors (6)

  1. Graph families
  2. Graphs
  3. Graph theory
  4. Fields of mathematics
  5. Mathematics
  6. Home