Pages that link to "Item:Q1331895"
From MaRDI portal
The following pages link to A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895):
Displaying 35 items.
- Stick graphs with length constraints (Q2206824) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Segment representations with small resolution (Q2338214) (← links)
- Lower bounds for boxicity (Q2341923) (← links)
- Boxicity of graphs on surfaces (Q2376090) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Boundary properties of the satisfiability problems (Q2450928) (← links)
- Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs (Q2457021) (← links)
- Boxicity and maximum degree (Q2477634) (← links)
- Boxicity of series-parallel graphs (Q2509298) (← links)
- Cubicity, degeneracy, and crossing number (Q2509731) (← links)
- Boxicity and treewidth (Q2642011) (← links)
- Local boxicity and maximum degree (Q2675846) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- String graphs of k-bend paths on a grid (Q2840697) (← links)
- Spanning galaxies in digraphs (Q2851453) (← links)
- Cubicity of Interval Graphs and the Claw Number (Q2851505) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- The Complexity of the Partial Order Dimension Problem: Closing the Gap (Q2957691) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- On the Cubicity of Interval Graphs (Q3503487) (← links)
- Optimal grid representations (Q4651928) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- The Complexity of Several Realizability Problems for Abstract Topological Graphs (Q5452218) (← links)
- Recognition and drawing of stick graphs (Q5915944) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- Extension of some edge graph problems: standard, parameterized and approximation complexity (Q6048430) (← links)
- Relating planar graph drawings to planar satisfiability problems (Q6121427) (← links)
- Separability, boxicity, and partial orders (Q6139870) (← links)
- Hardness of uncertain segment cover, contiguous SAT and visibility with uncertain obstacles (Q6174144) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
