Pages that link to "Item:Q293307"
From MaRDI portal
The following pages link to The homogeneous set sandwich problem (Q293307):
Displayed 22 items.
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- Note on the homogeneous set sandwich problem (Q834997) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- A note on finding all homogeneous set sandwiches (Q1014412) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Competitive graph searches (Q2481952) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
- (Q5708521) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)