How the proof of the strong perfect graph conjecture was found

zbMATH Open1189.05068MaRDI QIDQ3621680FDOQ3621680

Paul Seymour

Publication date: 21 April 2009

Recommendations

• The strong perfect graph theorem
• The strong perfect graph theorem
• scientific article; zbMATH DE number 1789914
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Classes of perfect graphs

zbMATH Keywords

chromatic numberinduced subgraphclique numberStrong Perfect Graph Conjecture

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) History of mathematics in the 20th century (01A60) Perfect graphs (05C17) History of combinatorics (05-03)

Cited In (7)

• Injective colorings of graphs with low average degree
• Coloring perfect graphs with no balanced skew-partitions
• An SDP primal-dual algorithm for approximating the Lovász-theta function
• How the upper bound conjecture was proved
• On some graph classes related to perfect graphs: a survey
• A characterization of the weighted Lovász number based on convex quadratic programming
• The strong perfect graph conjecture: 40 years of attempts, and its resolution

This page was built for publication: How the proof of the strong perfect graph conjecture was found

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3621680)