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 50 items.
- Structural parameterizations for boxicity (Q289935) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Chronological rectangle digraphs (Q324764) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Boxicity of line graphs (Q409342) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- Reasoning about visibility (Q420853) (← links)
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874) (← links)
- Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms (Q522969) (← links)
- On orthogonal ray graphs (Q602682) (← links)
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph (Q602742) (← links)
- Simple realizability of complete abstract topological graphs in P (Q633211) (← links)
- Boxicity of circular arc graphs (Q659754) (← links)
- Grid intersection graphs and order dimension (Q722596) (← links)
- A constant factor approximation algorithm for boxicity of circular arc graphs (Q741528) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- CPG graphs: some structural and hardness results (Q827595) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- On orthogonal ray trees (Q908312) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers (Q968201) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- On the cubicity of bipartite graphs (Q987780) (← links)
- The cubicity of hypercube graphs (Q998463) (← links)
- Boxicity of graphs with bounded degree (Q1024326) (← links)
- Cubicity, boxicity, and vertex cover (Q1025509) (← links)
- An upper bound for cubicity in terms of boxicity (Q1025528) (← links)
- Boxicity of Halin graphs (Q1025946) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- On the cubicity of interval graphs (Q1043802) (← links)
- The capture time of a graph (Q1045043) (← links)
- Co-bipartite neighborhood edge elimination orderings (Q1689989) (← links)
- Sublinear approximation algorithms for boxicity and related problems (Q1693125) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Local and union boxicity (Q1709530) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Face covers and the genus problem for apex graphs (Q1850536) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- It is tough to be a plumber (Q1885007) (← links)
- Permuting matrices to avoid forbidden submatrices (Q1894366) (← links)
- Spanners of bounded degree graphs (Q1944059) (← links)
- On the complexity of solution extension of optimization problems (Q2072063) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Complexity of domination in triangulated plane graphs (Q2178742) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
