On the Size of Planarly Connected Crossing Graphs
- 8 December 2016
- book chapter
- Published by Springer Nature
- p. 311-320
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- On grids in topological graphsComputational Geometry, 2014
- Applications of a New Separator Theorem for String GraphsCombinatorics, Probability and Computing, 2013
- Coloring-free intersection graphs of geometric objects in the planeEuropean Journal of Combinatorics, 2012
- Graphs That Admit Polyline Drawings with Few Crossing AnglesSIAM Journal on Discrete Mathematics, 2012
- 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
- Quasi-planar graphs have a linear number of edgesCombinatorica, 1997
- A turán-type theorem on chords of a convex polygonJournal of Combinatorial Theory, Series B, 1992
- Notes on geometric graph theory1991
- Über wesentlich unplättbare Kurven im dreidimensionalen RaumeFundamenta Mathematicae, 1934