Pages that link to "Item:Q1613390"
From MaRDI portal
The following pages link to The graph sandwich problem for 1-join composition is NP-complete (Q1613390):
Displayed 9 items.
- 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)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
- (Q5708521) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)