Pages that link to "Item:Q4887017"
From MaRDI portal
The following pages link to Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques (Q4887017):
Displayed 21 items.
- Minimal proper interval completions (Q963366) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- Embeddings of \(k\)-connected graphs of pathwidth \(k\) (Q1764809) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- (Q5708521) (← links)
- Bandwidth and topological bandwidth of graphs with few \(P_4\)'s (Q5954243) (← links)
- On Physical Mapping and the consecutive ones property for sparse matrices (Q5961616) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
