Compositions for perfect graphs
From MaRDI portal
Redirect page
Redirect to:
Recommendations
Cites work
- scientific article; zbMATH DE number 3889583 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3598496 (Why is no real title available?)
- scientific article; zbMATH DE number 3414349 (Why is no real title available?)
- A Combinatorial Decomposition Theory
- An algorithm for finding clique cut-sets
- Decomposition of Directed Graphs
- Normal hypergraphs and the perfect graph conjecture
- On the perfect graph conjecture
- Topics on perfect graphs
Cited in
(43)- On the structure of self-complementary graphs
- \(O(m\log n)\) split decomposition of strongly-connected graphs
- Detecting 2-joins faster
- Decomposition of perfect graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- The stable set polytope of claw-free graphs with large stability number
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
- Quasi-star-cutsets and some consequences
- Structure and algorithms for (cap, even hole)-free graphs
- scientific article; zbMATH DE number 809166 (Why is no real title available?)
- Graph amalgamation under logical constraints
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
- The homogeneous set sandwich problem
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
- Substitution and \(\chi\)-boundedness
- The structure of bull-free perfect graphs
- A description of claw-free perfect graphs
- Stable sets and graphs with no even holes
- Balanced matrices
- 2-clique-bond of stable set polyhedra
- Skew partitions in perfect graphs
- Decomposing Berge graphs and detecting balanced skew partitions
- Amalgams and -boundedness
- Polyhedral consequences of the amalgam operation
- Fast Skew Partition Recognition
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Decomposition of balanced matrices
- Even-hole-free graphs. I: Decomposition theorem
- Integral sum graphs G n and G -r,n are perfect graphs
- Square-free perfect graphs.
- On the linear extension complexity of stable set polytopes for perfect graphs
- Building counterexamples
- Combinatorial optimization with 2-joins
- Bounding χ in terms of ω and Δ for quasi-line graphs
- Basic perfect graphs and their extensions
- Star-cutsets and perfect graphs
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm
- A faster algorithm to recognize even-hole-free graphs
- scientific article; zbMATH DE number 3887730 (Why is no real title available?)
- Balanced \(0,\pm 1\) matrices. I: Decomposition
- Even-hole-free graphs part II: Recognition algorithm
This page was built for publication: Compositions for perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266722)
