Finite Prime Distance Graphs and 2-Odd Graphs

Joshua D. Laison, Colin Starr, Andrea Walker

A graph $G$ is a prime distance graph (respectively, a 2-odd graph) if its vertices can be labeled with distinct integers such that for any two adjacent vertices, the difference of…