The following pages link to Detecting 2-joins faster (Q2376790):
Displaying 9 items.
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. III: Cliques, stable sets and coloring (Q2173433) (← links)
- The (theta, wheel)-free graphs. IV: Induced paths and cycles (Q2221936) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- (Q5743476) (← links)
