The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- 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)
- 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)
- 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)
- 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)
- Some structural graph properties of the non-commuting graph of a class of finite Moufang loops (Q4957997) (← links)
- The coloring of the cozero-divisor graph of a commutative ring (Q4965898) (← links)
- Implosive graphs: Square-free monomials on symbolic Rees algebras (Q4975381) (← links)
- Normal subgroup based power graphs of a finite group (Q4978385) (← links)
- OPEN PACKING NUMBER FOR SOME CLASSES OF PERFECT GRAPHS (Q4986289) (← links)
- Metrically homogeneous graphs of diameter 3 (Q4991900) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- Counting Weighted Independent Sets beyond the Permanent (Q4997141) (← links)
- THE CHARACTER GRAPH OF A FINITE GROUP IS PERFECT (Q4999619) (← links)
- A new characterization of trivially perfect graphs (Q5006549) (← links)
- The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair (Q5009982) (← links)
- On eternal domination and Vizing-type inequalities (Q5012368) (← links)
- Fractional Chromatic Number, Maximum Degree, and Girth (Q5013575) (← links)
- Recent developments on the power graph of finite groups – a survey (Q5016217) (← links)
- Enhanced power graphs of groups are weakly perfect (Q5060446) (← links)
- Digraphs and Variable Degeneracy (Q5062115) (← links)
- Counting Small Induced Subgraphs Satisfying Monotone Properties (Q5071087) (← links)
- Simultaneously dominating all spanning trees of a graph (Q5081207) (← links)