Pages that link to "Item:Q2255038"
From MaRDI portal
The following pages link to The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038):
Displaying 11 items.
- The chain graph sandwich problem (Q646705) (← links)
- Complexity and algorithms for graph and hypergraph sandwich problems (Q1268114) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Sandwich and probe problems for excluding paths (Q1627855) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)