Construct · 1 fields · 1 citations

strong perfect graph theorem: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Graph theory

the characterization that a graph is perfect exactly when it contains no odd hole and no odd antihole as an induced subgraph.

In graph theory, strong perfect graph theorem refers to the characterization that a graph is perfect exactly when it contains no odd hole and no odd antihole as an induced subgraph. This meaning comes from Chudnovsky (2006) in Annals of Mathematics.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how strong perfect graph theorem sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

hole3 fields · 5 citationsjingle · one word, three constructs

References

Chudnovsky, M., Robertson, N., Seymour, P., & Thomas, R. (2006). The strong perfect graph theorem. Annals of Mathematics, 164(1), 51-229. https://doi.org/10.4007/annals.2006.164.51

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct