A graph is periodic if it can be obtained by joining identical pieces in a cyclic fashion. It is shown that the limit crossing number of a periodic graph is computable. This answers a question of Benny Pinontoan and Bruce Richter (2004).
@article{arxiv.1405.5117,
title = {Crossing numbers of periodic graphs},
author = {Zdenek Dvorak and Bojan Mohar},
journal= {arXiv preprint arXiv:1405.5117},
year = {2014}
}