Pages that link to "Item:Q5141646"
From MaRDI portal
The following pages link to Recognizing Stick Graphs with and without Length Constraints (Q5141646):
Displaying 3 items.
- Planar straight-line realizations of 2-trees with prescribed edge lengths (Q2151440) (← links)
- On the complexity of recognizing Stick, BipHook and max point-tolerance graphs (Q2693628) (← links)
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths (Q6563990) (← links)
