Pages that link to "Item:Q765197"
From MaRDI portal
The following pages link to Combinatorial optimization with 2-joins (Q765197):
Displaying 13 items.
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs (Q1709574) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Induced subgraphs and tree decompositions. I: Even-hole-free graphs of bounded degree (Q2171016) (← 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)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- Linear Balanceable and Subcubic Balanceable Graphs* (Q2874096) (← links)
- (Q5743476) (← links)
- Minimum weighted clique cover on claw‐free perfect graphs (Q6055392) (← links)
