On topological graphs with at most four crossings per edge
Author:
- Eyal AckermanEAEyal Ackerman
Top Cited Papers
- 1 December 2019
- journal article
- research article
- Published by Elsevier in Computational Geometry
- Vol. 85
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Covering Lattice Points by Subspaces and Counting Point–Hyperplane IncidencesDiscrete & Computational Geometry, 2018
- Regular Matchstick GraphsThe American Mathematical Monthly, 2011
- On the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing EdgesDiscrete & Computational Geometry, 2009
- On the maximum number of edges in quasi-planar graphsJournal of Combinatorial Theory, Series A, 2007
- Improving the Crossing Lemma by Finding More Crossings in Sparse GraphsDiscrete & Computational Geometry, 2006
- An improvement of the crossing number boundJournal of Graph Theory, 2005
- Graphs drawn with few crossings per edgeCombinatorica, 1997