On the strong perfect graph conjecture
From MaRDI portal
Publication:5905679
DOI10.1016/0095-8956(76)90005-8zbMath0293.05117OpenAlexW2120115090MaRDI QIDQ5905679
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
Related Items (19)
Near-perfect matrices ⋮ A construction for non-rank facets of stable set polytopes of webs ⋮ On essential components and critical sets of a graph ⋮ Graphical properties related to minimal imperfection ⋮ Well-covered circulant graphs ⋮ An approach to solving \(A^{k}=J-I\) ⋮ A classification of certain graphs with minimal imperfection properties ⋮ On stable set polyhedra for K//(1,3)free graphs ⋮ Antitwins in partitionable graphs ⋮ On non-rank facets of stable set polytopes of webs with clique number four ⋮ Perfect graphs involving semitotal and semipaired domination ⋮ Critical perfect graphs and perfect 3-chromatic graphs ⋮ Combinatorial designs related to the strong perfect graph conjecture ⋮ Independence polynomials of circulants with an application to music ⋮ Unnamed Item ⋮ Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture ⋮ Uniquely colorable perfect graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Almost all webs are not rank-perfect
Cites Work
This page was built for publication: On the strong perfect graph conjecture
