Normal hypergraphs and the perfect graph conjecture

1972/06/01 by László Lovász, L. Lovász · 20 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Chromatic scale #Combinatorics #Complement (music) #Conjecture #Discrete mathematics #Disjoint sets #Existential quantification #Graph #Hypergraph #Mathematics #Sharpening #graph theory and CDMA systems

paper · pdf · doi:10.1016/0012-365x(72)90006-4

crossref issued 1972/06/01 · crossref published 1972/06/01 · crossref published-print 1972/06/01 · openalex publication_date 1972/06/01 · crossref created 2002/07/26 · crossref deposited 2019/04/13 · openalex created_date 2025/10/10 · crossref indexed 2026/07/20 · openalex updated_date 2026/07/31

Cited by

• Approximating treewidth and pathwidth of some classes of perfect graphs
• Substitution and χ -boundedness
• Minimax theorems for hypergraphs
• A note on perfect graphs
• On a conjecture of Meyniel
• The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution
• Progress on perfect graphs
• Star-cutsets and perfect graphs
• On the coloration of perfect graphs
• On the perfect graph conjecture
• Polynomial Algorithm to Recognize a Meyniel Graph
• Bull-free Berge graphs are perfect
• Compositions for perfect graphs
• Fast parallel algorithms for chordal graphs
• On testing isomorphism of permutation graphs
• Dilworth's theorem [wikipedia]
• Kőnig's theorem (graph theory) [wikipedia]
• Perfect graph [wikipedia]
• Perfect graph theorem [wikipedia]
• Strong perfect graph theorem [wikipedia]