The following pages link to Graph Sandwich Problems (Q4857542):
Displaying 35 items.
- Chordal bipartite completion of colored graphs (Q2427516) (← links)
- Competitive graph searches (Q2481952) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- Characterizing and recognizing probe block graphs (Q2513611) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- Obstructing Visibilities with One Obstacle (Q2961523) (← links)
- Recognition of Probe Ptolemaic Graphs (Q3000516) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- The P4-sparse Graph Sandwich Problem (Q3439332) (← links)
- Helly Property and Sandwich Graphs (Q3439387) (← links)
- The Generalized Max-Controlled Set Problem (Q3503549) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints (Q3511357) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Tree Projections: Game Characterization and Computational Aspects (Q3655155) (← links)
- (Q4982361) (← links)
- (Q5075828) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
- On the <i>L</i>(<i>h</i>, <i>k</i>)‐labeling of co‐comparability graphs and circular‐arc graphs (Q5191125) (← links)
- An improved derandomized approximation algorithm for the max-controlled set problem (Q5198931) (← links)
- (Q5708521) (← links)
- (Q5743514) (← links)
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs (Q5895109) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
