# Category:Perfect graphs

Computing portal |

Here is a list of articles in the Perfect graphs category of the Computing portal that unifies foundations of mathematics and computations using computers.

A graph is perfect if it can be colored with as many colors as it has vertices in its maximum clique, and if moreover the same property is true in every induced subgraph. This category collects families of graphs that are notable for being perfect, as well as some related mathematical results.

## Pages in category "Perfect graphs"

The following 33 pages are in this category, out of 33 total.

- Perfect graph
*(computing)*

### A

- Apollonian network
*(computing)*

### B

- Block graph
*(computing)*

### C

- Chordal graph
*(computing)* - Cluster graph
*(computing)* - Cograph
*(computing)* - Comparability graph
*(computing)*

### D

- Dilworth's theorem
*(computing)* - Distance-hereditary graph
*(computing)* - Dually chordal graph
*(computing)*

### I

- Indifference graph
*(computing)* - Interval graph
*(computing)*

### K

- K-tree
*(computing)* - Kőnig's theorem (graph theory)
*(computing)*

### L

- Leaf power
*(computing)* - Line perfect graph
*(computing)*

### M

- Meyniel graph
*(computing)* - Mirsky's theorem
*(computing)*

### P

- Parity graph
*(computing)* - Perfect graph theorem
*(computing)* - Perfectly orderable graph
*(computing)* - Permutation graph
*(computing)* - Ptolemaic graph
*(computing)*

### R

- Rook's graph
*(computing)*

### S

- Skew partition
*(computing)* - Split graph
*(computing)* - Strong perfect graph theorem
*(computing)* - Strongly chordal graph
*(computing)*

### T

- Threshold graph
*(computing)* - Tolerance graph
*(computing)* - Trapezoid graph
*(computing)* - Trivially perfect graph
*(computing)*

### W

- Windmill graph
*(computing)*