On the strong perfect graph conjecture

DOI10.1016/0095-8956(76)90005-8MaRDI QIDQ5905679zbMATH OpenOpenAlexFDO

Authors Vašek Chvátal

Publication date 1976

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(76)90005-8

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• A characterization of perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Perfect zero–one matrices

Cited in

(19)

• Independence polynomials of circulants with an application to music
• The strong perfect graph conjecture: 40 years of attempts, and its resolution
• Graphical properties related to minimal imperfection
• A classification of certain graphs with minimal imperfection properties
• On stable set polyhedra for K//(1,3)free graphs
• Antitwins in partitionable graphs
• Critical perfect graphs and perfect 3-chromatic graphs
• Combinatorial designs related to the strong perfect graph conjecture
• Near-perfect matrices
• On essential components and critical sets of a graph
• An approach to solving \(A^{k}=J-I\)
• Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
• Uniquely colorable perfect graphs
• On non-rank facets of stable set polytopes of webs with clique number four
• Almost all webs are not rank-perfect
• scientific article; zbMATH DE number 2230253 (Why is no real title available?)
• Well-covered circulant graphs
• Perfect graphs involving semitotal and semipaired domination
• A construction for non-rank facets of stable set polytopes of webs

This page was built for publication: On the strong perfect graph conjecture

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