Perfect graphs and intersection graphs
Summary
This topic is a part of graph theory. It covers graphs in which the chromatic number equals the clique number on every induced subgraph, the perfect graph theorems, the intersection graph classes that are perfect or close to perfect, and the Lovász theta function.
About this page
| Tag | 5MS2H43979 |
|---|---|
| URI | m2://5MS2H43979 |
| Kind | topic |
| Writing | W0 stub |
| MSC | 05C17, 05C62 |
| Part of | Graph theory |
| Changed | 17 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a same_as or a source (0 of 1)
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
History
Each change to this page, from its provenance log. A change by an agent names its run.
| Date | Change | Field | By |
|---|---|---|---|
| 2026-11-17 | add | the whole node | tamnd |
What links here
No page links to this page yet.