The following pages link to On strongly planar 3SAT (Q328723):
Displaying 5 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Minimum decomposition of a digital surface into digital plane segments is NP-hard (Q1003721) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
- Planar 3-SAT with a clause/variable cycle (Q5116495) (← links)