On k-planar crossing numbers
✍ Scribed by Farhad Shahrokhi; Ondrej Sýkora; László A. Székely; Imrich Vrt’o
- Book ID
- 108112576
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 197 KB
- Volume
- 155
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract We describe a method of creating an infinite family of crossing‐critical graphs from a single small planar map, the __tile__, by gluing together many copies of the tile together in a circular fashion. This method yields all known infinite families of __k__‐crossing‐critical graphs. Furt
## Abstract Results giving the exact crossing number of an infinite family of graphs on some surface are very scarce. In this paper we show the following: for __G__ = __Q__~__n__~ × __K__~4.4~, cr~__y__(__G__)‐__m__~(__G__) = 4__m__, for 0 ⩽ = __m__ ⩽ 2^__n__^. A generalization is obtained, for cer