Pages that link to "Item:Q1690053"
From MaRDI portal
The following pages link to On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053):
Displaying 6 items.
- On the distance and multidistance graph embeddability problem (Q334409) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs (Q5009472) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
- Complexity of recognizing multidistance graphs in \(\mathbb{R}^d\) (Q6576764) (← links)