Pages that link to "Item:Q4887017"

The following pages link to Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques (Q4887017):

Displaying 46 items.

• Bandwidth of chain graphs (Q293476) (← links)
• Complexity of rainbow vertex connectivity problems for restricted graph classes (Q505435) (← links)
• The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
• Bandwidth and pathwidth of three-dimensional grids (Q534058) (← links)
• Bandwidth on AT-free graphs (Q650939) (← links)
• Canonical antichains of unit interval and bipartite permutation graphs (Q651422) (← links)
• Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
• Mixed unit interval graphs (Q713160) (← links)
• Further hardness results on rainbow and strong rainbow connectivity (Q908308) (← links)
• 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)
• Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← 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)
• Integral mixed unit interval graphs (Q1949108) (← links)
• \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited (Q2067672) (← links)
• Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees (Q2427498) (← links)
• Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
• The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
• Exploring the Subexponential Complexity of Completion Problems (Q2828210) (← links)
• (Q2857436) (← links)
• Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← 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)
• Intervalizing k-colored graphs (Q4645169) (← links)
• Unit Interval Graphs of Open and Closed Intervals (Q4916100) (← links)
• (Q5089227) (← links)
• A CHARACTERIZATION OF k-TH POWERS P_n,k OF PATHS IN TERMS OF k-TREES (Q5249270) (← links)
• (Q5708521) (← links)
• Minimum reload cost graph factors (Q5918369) (← links)
• Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← 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)
• Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs (Q6064836) (← links)
• Small Point-Sets Supporting Graph Stories (Q6141788) (← links)