The following pages link to (Q3222886):
Displaying 24 items.
- Graphs of separability at most 2 (Q415268) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Decomposition of perfect graphs (Q1072566) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- On a conjecture of Meyniel (Q1096652) (← links)
- Paw-free graphs (Q1108293) (← links)
- Recognizing claw-free perfect graphs (Q1118619) (← links)
- Star-cutsets and perfect graphs (Q1121289) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- On slim graphs, even pairs, and star-cutsets (Q1199476) (← links)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
- The maximum clique problem (Q1318271) (← links)
- Polyhedral consequences of the amalgam operation (Q1331977) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- On kernels in i-triangulated graphs (Q1821791) (← links)
- Minimal antichains in well-founded quasi-orders with an application to tournaments (Q1850501) (← links)
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
- Compositions for perfect graphs (Q2266722) (← links)
- Recognition of quasi-Meyniel graphs (Q5951967) (← links)
- Strong cliques in vertex‐transitive graphs (Q6134644) (← links)
