Binnendyk, E. (2025). Determining unit distance graphs with coordinates in $\mathbb{Z}^2$ is NP-complete.
Citazione stile Chigago Style (17a edizione)Binnendyk, Eric. Determining Unit Distance Graphs with Coordinates in $\mathbb{Z}^2$ Is NP-complete. 2025.
Citatione MLA (9a ed.)Binnendyk, Eric. Determining Unit Distance Graphs with Coordinates in $\mathbb{Z}^2$ Is NP-complete. 2025.
Attenzione: Queste citazioni potrebbero non essere precise al 100%.