Zdenek Dvorak, Bojan Mohar
Published 2014-05-20Version 1
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).
Related articles:
Flexible placements of periodic graphs in the plane
Zeta functions of periodic graphs derived from quantum walk
Zeta functions with respect to general coined quantum walk of periodic graphs
![QR code for arXiv:1405.5117 [math.CO]](http://oss.arxitics.com/images/favicon.svg)