Pages that link to "Item:Q1690053"

The following pages link to On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053):

Displaying 2 items.

• Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
• Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)