Pages that link to "Item:Q5937922"
From MaRDI portal
The following pages link to Contact graphs of line segments are NP-complete (Q5937922):
Displaying 14 items.
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Intersection graphs of segments (Q1338319) (← links)
- On contact graphs of paths on a grid (Q1725765) (← links)
- On some special classes of contact \(B_0\)-VPG graphs (Q2064288) (← links)
- Characterising circular-arc contact \(B_0\)-VPG graphs (Q2192099) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count (Q4625139) (← links)
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs (Q4961756) (← links)
- (Q5136241) (← links)
- Graph Drawing (Q5711607) (← links)
- Proportional Contact Representations of Planar Graphs (Q5895512) (← links)
- Weighted Maximum Independent Set of Geometric Objects in Turnstile Streams. (Q6058197) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)