Premium
Crossing Numbers of Periodic Graphs
Author(s) -
Dvořák Zdeněk,
Mohar Bojan
Publication year - 2016
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.21912
Subject(s) - mathematics , combinatorics , crossing number (knot theory) , graph , limit (mathematics) , discrete mathematics , mathematical analysis , intersection (aeronautics) , engineering , aerospace engineering
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 Richter [1, Problem 4.2].
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom