Biplanar Crossing Numbers I: A Survey of Results and Problems
- 1 January 2006
- book chapter
- Published by Springer Nature
- p. 57-77
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- The crossing number of Cm × Cn is as conjectured for n ≥ m(m + 1)Journal of Graph Theory, 2004
- The Thickness of Graphs: A SurveyGraphs and Combinatorics, 1998
- Biplanar Graphs:Computers & Mathematics with Applications, 1997
- Subcube Fault-Tolerance in HypercubesInformation and Computation, 1993
- Multilayer grid embeddings for VLSIAlgorithmica, 1991
- Bounds for the crossing number of theN-cubeJournal of Graph Theory, 1991
- On the genus and thickness of graphsJournal of Combinatorial Theory, Series B, 1987
- Determining the thickness of graphs is NP-hardMathematical Proceedings of the Cambridge Philosophical Society, 1983
- The crossing number of K5,nJournal of Combinatorial Theory, 1970
- Every planar graph with nine points has a nonplanar complementBulletin of the American Mathematical Society, 1962