The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Characterizing N+-perfect line graphs (Q2968506) (← links)
- Exact and Parameterized Algorithms for (k, i)-Coloring (Q2971658) (← links)
- Graphs with No Induced Five‐Vertex Path or Antipath (Q2978172) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- GUARDING ORTHOGONAL ART GALLERIES WITH SLIDING CAMERAS (Q2999096) (← links)
- Shortest Paths between Shortest Paths and Independent Sets (Q3000494) (← links)
- Graphs of Separability at Most Two: Structural Characterizations and Their Consequences (Q3000517) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- Parameterized Complexity of Vertex Deletion into Perfect Graph Classes (Q3088287) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- Comparing Imperfection Ratio and Imperfection Index for Graph Classes (Q3163670) (← links)
- The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs (Q3181049) (← links)
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths (Q3195131) (← links)
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings (Q3297043) (← links)
- Graph minor theory (Q3372389) (← links)
- Algorithms for 3PC(⋅, ⋅)-free Berge graphs (Q3439311) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- Characterization and recognition of Helly circular-arc clique-perfect graphs (Q3439325) (← links)
- 2K2-Partition Problem (Q3439337) (← links)
- On strongly circular-perfectness (Q3439367) (← links)
- Colouring Some Classes of Perfect Graphs Robustly (Q3439399) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- Component Acquisition Games (Q3459305) (← links)
- Testing Consumer Rationality Using Perfect Graphs and Oriented Discs (Q3460788) (← links)
- Circular-imperfection of triangle-free graphs (Q3503467) (← links)
- The Induced Disjoint Paths Problem (Q3503839) (← links)
- Fixed-Point Definability and Polynomial Time on Chordal Graphs and Line Graphs (Q3586010) (← links)
- Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- Path-Bicolorable Graphs (Q3655151) (← links)
- Desert island theorems (Q3745839) (← links)
- Families of graphs complete for the strong perfect graph Conjecture (Q3760583) (← links)
- The M-intersection graph of ideals of a commutative ring (Q4554569) (← links)
- Structural properties of super strongly perfect graphs (Q4577861) (← links)
- On the zero-divisor graphs of finite free semilattices (Q4633194) (← links)
- Odd Holes in Bull-Free Graphs (Q4638616) (← links)
- A short proof of the wonderful lemma (Q4638626) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- Disjoint clique cutsets in graphs without long holes (Q4676589) (← links)
- Finding<i>H</i>-partitions efficiently (Q4680731) (← links)
- The perfection and recognition of bull-reducible Berge graphs (Q4680732) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
- Recursive generation of partitionable graphs (Q4798118) (← links)
- A limit theorem for the Shannon capacities of odd cycles. II (Q4825646) (← links)
- THE JACOBSON GRAPH OF COMMUTATIVE RINGS (Q4916168) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
