Crossing numbers of periodic graphs

2014/05/20 by Zdenĕk Dvořák, Dvorak, Zdenek, Bojan Mohar +1
Biochemistry, Genetics and Molecular Biology · Computer Science · #05C10 #Cellular Automata and Applications #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #DNA and Biological Computing #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.1405.5117

openalex publication_date 2014/05/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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).

Related

• A necessary and sufficient condition for lower bounds on crossing numbers of generalized periodic graphs in an arbitrary surface
• Unexpected behaviour of crossing sequences
• A survey of graphs with known or bounded crossing numbers
• Counting spanning trees of (1, N)-periodic graphs
• On a conjecture of Pach-Spencer-Tóth for graph crossing numbers