The following pages link to On the perfect graph conjecture (Q1248633):
Displaying 40 items.
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- Skeletal graphs - a new class of perfect graphs (Q582304) (← links)
- Meyniel weakly triangulated graphs. I: Co-perfect orderability (Q678852) (← links)
- Ramsey-type theorems (Q751670) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- A notion of cross-perfect bipartite graphs (Q1029000) (← links)
- New classes of perfect graphs (Q1087552) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On a conjecture of Meyniel (Q1096652) (← links)
- Slender graphs (Q1096653) (← links)
- Recognizing max-flow min-cut path matrices (Q1103514) (← links)
- A new property of critical imperfect graphs and some consequences (Q1104342) (← links)
- Locally perfect graphs (Q1105623) (← links)
- A fast algorithm for coloring Meyniel graphs (Q1111563) (← links)
- Forbidden graphs for degree and neighbourhood conditions (Q1119603) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- Slim graphs (Q1123217) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Meyniel graphs are strongly perfect (Q1171076) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- On minimal imperfect graphs without induced \(P_5\) (Q1293187) (← links)
- The maximum clique problem (Q1318271) (← links)
- On \(m\)-centers in \(P_ t\)-free graphs (Q1322266) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Meyniel weakly triangulated graphs. II: A theorem of Dirac (Q1377671) (← links)
- On essential components and critical sets of a graph (Q1377850) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Graphs vertex-partitionable into strong cliques (Q1709542) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Detecting strong cliques (Q2312812) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Covering, Packing and Generalized Perfection (Q3220635) (← links)
- HOLES AND DOMINOES IN MEYNIEL GRAPHS (Q5248996) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)
