Pages that link to "Item:Q1887051"

The following pages link to On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051):

Displaying 13 items.

• The external constraint 4 nonempty part sandwich problem (Q531610) (← 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)
• The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
• Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
• Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
• On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
• The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
• The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
• The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)