The strong perfect graph theorem

Maria Chudnovsky, N. R., Seymour, P., & Thomas, R. (2006). The strong perfect graph theorem.

Type

Unclassified

Intellectual base

Unclassified

Year

2006

DOI

10.4007/annals.2006.164.51

Link

https://doi.org/10.4007/annals.2006.164.51

Cited by

1 citation across 1 artifact.

Domain-specific

• Claw-free graph
  • … observable transfers from Every line graph is claw-free because edges incident to one original edge cannot form three mutually nonadjacent neighbors in the line graph. to Recognition tests induced rather than ordinary subgraphs and uses the neighborhood formulation to avoid false positives caused by extra leaf edges..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:ff5a640209a4 · see in the full table