The following pages link to Graph Sandwich Problems (Q4857542):
Displaying 50 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Orienting graphs to optimize reachability (Q290248) (← links)
- The homogeneous set sandwich problem (Q293307) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Block-graph width (Q534563) (← links)
- On the forbidden induced subgraph sandwich problem (Q643008) (← links)
- The chain graph sandwich problem (Q646705) (← links)
- A characterization of chain probe graphs (Q646709) (← links)
- Two characterizations of chain partitioned probe graphs (Q646714) (← links)
- The pair completion algorithm for the homogeneous set sandwich problem (Q844163) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties (Q955347) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- On listing, sampling, and counting the chordal graphs with edge constraints (Q974754) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- On the bi-enhancement of chordal-bipartite probe graphs (Q991750) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- A note on finding all homogeneous set sandwiches (Q1014412) (← links)
- The graph sandwich problem for \(P_4\)-sparse graphs (Q1025565) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Tree-visibility orders (Q1584374) (← links)
- An efficient algorithm for solving the homogeneous set sandwich problem (Q1607076) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Sandwich and probe problems for excluding paths (Q1627855) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- The \((k, \ell)\) partitioned probe problem: NP-complete versus polynomial dichotomy (Q1686050) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- A vertex ordering characterization of simple-triangle graphs (Q1800397) (← links)
- On decision and optimization (\(k\),\(l\))-graph sandwich problems (Q1887051) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- Completing colored graphs to meet a target property (Q2030434) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- Bipartite completion of colored graphs avoiding chordless cycles of given lengths (Q2146743) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Clustering with partial information (Q2268879) (← links)
- Some completion problems for graphs without chordless cycles of prescribed lengths (Q2274074) (← links)
- Sandwiches missing two ingredients of order four (Q2288872) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Chordal bipartite completion of colored graphs (Q2427516) (← links)
