Crossing numbers of periodic graphs
classification
🧮 math.CO
keywords
periodiccrossinggraphanswersbennybrucecomputablecyclic
read the original abstract
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).
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.