Pages that link to "Item:Q3000515"
From MaRDI portal
The following pages link to On the Computational Complexity of Degenerate Unit Distance Representations of Graphs (Q3000515):
Displaying 4 items.
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Minimal graphs with respect to geometric distance realizability (Q2214306) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
