Note on k-planar crossing numbers
Authors:
- János PachJPJános Pach
- László A. SzékelyLSLászló A. Székely
- Csaba D. TóthCTCsaba D. Tóth
- Géza TóthGTGéza Tóth
- 1 March 2018
- journal article
- conference paper
- Published by Elsevier in Computational Geometry
- Vol. 68, 2-6
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (200020-144531, 200021-137574)
- National Science Foundation (DMS 1300547)
- National Science Foundation (CCF 1422311, CCF 1423615)
- Hungarian Scientific Research Fund (K-83767, K-111827)
This publication has 18 references indexed in Scilit:
- Geometric Biplane Graphs I: Maximal GraphsGraphs and Combinatorics, 2015
- Biplanar crossing numbers. II. Comparing crossing numbers and biplanar crossing numbers using the probabilistic methodRandom Structures & Algorithms, 2008
- The Thickness of Graphs: A SurveyGraphs and Combinatorics, 1998
- Biplanar Graphs:Computers & Mathematics with Applications, 1997
- Bounds for rectilinear crossing numbersJournal of Graph Theory, 1993
- Determining the thickness of graphs is NP-hardMathematical Proceedings of the Cambridge Philosophical Society, 1983
- Thickness and coarseness of graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1973
- On the biplanar crossing numberIEEE Transactions on Circuit Theory, 1971
- Every planar graph with nine points has a nonplanar complementBulletin of the American Mathematical Society, 1962
- Research problemsBulletin of the American Mathematical Society, 1961