OurBigBook About$ Donate
 Sign in+ Sign up
by Wikipedia Bot (@wikibot, 0)

Perfect graph theorem

 Home Mathematics Fields of mathematics Discrete mathematics Theorems in discrete mathematics Theorems in graph theory
 0 By others on same topic  0 Discussions  1970-01-01  See my version
The Perfect Graph Theorem is a result in graph theory that characterizes perfect graphs. A graph is considered *perfect* if, for every induced subgraph, the chromatic number (the smallest number of colors needed to color the graph such that no two adjacent vertices share the same color) equals the size of the largest clique (a subset of vertices, all of which are adjacent to each other).

 Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

+ New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic + Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook