The following pages link to Compositions for perfect graphs (Q2266722):
Displaying 36 items.
- The homogeneous set sandwich problem (Q293307) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- Stable sets and graphs with no even holes (Q745687) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Polyhedral consequences of the amalgam operation (Q1331977) (← links)
- Building counterexamples (Q1363703) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Decomposition of balanced matrices (Q1569060) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Basic perfect graphs and their extensions (Q1779506) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- Balanced \(0,\pm 1\) matrices. I: Decomposition (Q1850525) (← links)
- Balanced \(0,\pm 1\) matrices. II: Recognition algorithm (Q1850526) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Balanced matrices (Q2433704) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- Even-hole-free graphs part I: Decomposition theorem (Q2778281) (← links)
- The Structure of Bull-Free Perfect Graphs (Q2852609) (← links)
- (Q2861525) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
