Pages that link to "Item:Q2629266"

The following pages link to On computational complexity of length embeddability of graphs (Q2629266):

Displaying 3 items.

• On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
• Minimal graphs with respect to geometric distance realizability (Q2214306) (← links)
• Turán-type results for distance graphs in an infinitesimal plane layer (Q2632552) (← links)