Pages that link to "Item:Q2959779"
From MaRDI portal
The following pages link to Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees (Q2959779):
Displaying 11 items.
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Computing stable Demers cartograms (Q2206829) (← links)
- Who Needs Crossings? Hardness of Plane Graph Rigidity (Q3132834) (← links)
- (Q4427858) (← 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)
- Morphing Contact Representations of Graphs (Q5088937) (← links)
- (Q5136241) (← links)
- Morphing triangle contact representations of triangulations (Q6050235) (← links)
- Adjacency graphs of polyhedral surfaces (Q6541985) (← links)