Pages that link to "Item:Q1336635"
From MaRDI portal
The following pages link to Graph homomorphisms with infinite targets (Q1336635):
Displaying 3 items.
- On complexity of multidistance graph recognition in \(\mathbb{R}^1\) (Q1690053) (← links)
- Hereditarily hard \(H\)-colouring problems (Q1842146) (← links)
- Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514) (← links)
