The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs

DOI10.1016/0095-8956(79)90047-9zbMath0416.05062OpenAlexW2006530598MaRDI QIDQ754232

K. R. Parthasarathy, G. Ravindra

Publication date: 1979

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(79)90047-9

zbMATH Keywords

strong perfect graph conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance, Even and odd pairs in linegraphs of bipartite graphs, Generalized perfect graphs: Characterizations and inversion, Two classes of perfect graphs, On a Class of P ₅ -Free Graphs, Chair-free Berge graphs are perfect, Some properties of minimal imperfect graphs, Classes of perfect graphs, Addendum to: M. Conforti and M. R. Rao, ``Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, Discrete Mathematics 104 (1992) 23--47, Testing balancedness and perfection of linear matrices, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, Perfect product graphs, Perfectness of normal products of graphs, Odd cycles and matrices with integrality properties, Unnamed Item, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, The strong perfect graph conjecture: 40 years of attempts, and its resolution, The edge intersection graphs of paths in a tree, Quasi-star-cutsets and some consequences, Coloring perfect \((K_ 4\)-e)-free graphs

Cites Work

• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs