The following pages link to (Q3821582):
Displaying 19 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- NodeTrix planarity testing with small clusters (Q2319629) (← links)
- On planar valued CSPs (Q2396724) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Simultaneous Orthogonal Planarity (Q2961544) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Computing k-modal embeddings of planar digraphs (Q5075755) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)
- Polychromatic colorings of plane graphs (Q5896961) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- \(st\)-orientations with few transitive edges (Q6117048) (← links)
- Relating planar graph drawings to planar satisfiability problems (Q6121427) (← links)
- $st$-Orientations with Few Transitive Edges (Q6141787) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
