On the complexity of (k,l)-graph sandwich problems
From MaRDI portal
(Redirected from On the complexity of (k,l)-graph sandwich problems)
On the complexity of \((k,l)\)-graph sandwich problems
On the complexity of \((k,l)\)-graph sandwich problems
Recommendations
Cited in
(15)- Complexity and algorithms for graph and hypergraph sandwich problems
- The graph sandwich problem for 1-join composition is NP-complete
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy
- On decision and optimization (\(k\),\(l\))-graph sandwich problems
- Graph sandwich problem for the property of being well-covered and partitionable into \(k\) independent sets and \(\ell\) cliques
- Partitions and well-coveredness: the graph sandwich problem
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset
- scientific article; zbMATH DE number 5999585 (Why is no real title available?)
- New results on chordal-(k, l) and strongly chordal-(k, l) sandwich problems
- scientific article; zbMATH DE number 6423755 (Why is no real title available?)
- Complexity issues for the sandwich homogeneous set problem
- On (k, )-graph sandwich problems
- scientific article; zbMATH DE number 2230229 (Why is no real title available?)
- The chain graph sandwich problem
This page was built for publication: On the complexity of \((k,l)\)-graph sandwich problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414488)
