Compositions for perfect graphs
From MaRDI portal
Publication:2266722
DOI10.1016/S0012-365X(85)80001-7zbMath0562.05043WikidataQ56430120 ScholiaQ56430120MaRDI QIDQ2266722
Cornuéjols, Gérard, William H. Cunningham
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
05C99: Graph theory
Related Items
Fast Skew Partition Recognition, \(O(m\log n)\) split decomposition of strongly-connected graphs, \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth, The strong perfect graph conjecture: 40 years of attempts, and its resolution, Decomposition of perfect graphs, Star-cutsets and perfect graphs, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, A description of claw-free perfect graphs, Polyhedral consequences of the amalgam operation, Building counterexamples, Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs, Square-free perfect graphs., Decomposition of balanced matrices, Quasi-star-cutsets and some consequences, Basic perfect graphs and their extensions, Decomposition of odd-hole-free graphs by double star cutsets and 2-joins, Balanced \(0,\pm 1\) matrices. I: Decomposition, Balanced \(0,\pm 1\) matrices. II: Recognition algorithm, Balanced matrices, Decomposing Berge graphs and detecting balanced skew partitions, Skew partitions in perfect graphs, A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs, Even-hole-free graphs part I: Decomposition theorem, Even-hole-free graphs part II: Recognition algorithm, On the structure of self-complementary graphs, A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs, Bounding χ in terms of ω and Δ for quasi-line graphs
Cites Work
