Star-cutsets and perfect graphs
From MaRDI portal
Publication:1121289
DOI10.1016/0095-8956(85)90049-8zbMath0674.05058WikidataQ56430118 ScholiaQ56430118MaRDI QIDQ1121289
Publication date: 1985
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(85)90049-8
Related Items
Counterexamples to three conjectures concerning perfect graphs, Some properties of minimal imperfect graphs, Short-chorded and perfect graphs, Dominating cliques in \(P_ 5\)-free graphs, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, On slim graphs, even pairs, and star-cutsets, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, On minimal imperfect graphs without induced \(P_5\), \(P_4\)-domination in minimal imperfect graphs, New classes of Berge perfect graphs, Even and odd pairs in linegraphs of bipartite graphs, Quasi-parity and perfect graphs, On a class of square-free graphs, Path parity and perfection, Perfect graphs with unique \(P_ 4\)-structure, Building counterexamples, Chair-free Berge graphs are perfect, On a conjecture about uniquely colorable perfect graphs, A generalization of Chvátal's star-cutset lemma, Recognizing bull-free perfect graphs, Discs in unbreakable graphs, Powers of distance-hereditary graphs, A new class of perfect Hoàng graphs, On edge perfectness and classes of bipartite graphs, Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs, Most unbreakable murky graphs are bull-free
