Pages that link to "Item:Q2464161"
From MaRDI portal
The following pages link to Decomposing Berge graphs and detecting balanced skew partitions (Q2464161):
Displaying 10 items.
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Coloring perfect graphs with no balanced skew-partitions (Q490982) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← 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)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- Fast Skew Partition Recognition (Q5302744) (← links)
