On the Size of Planarly Connected Crossing Graphs
From MaRDI portal
Publication:2961524
DOI10.1007/978-3-319-50106-2_24zbMath1478.68205OpenAlexW2963804516MaRDI QIDQ2961524
Balázs Keszegh, Eyal Ackerman, Máté Vizer
Publication date: 21 February 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/40904/1/1509.02475v3.pdf
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Cites Work
- Unnamed Item
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- On the maximum number of edges in quasi-planar graphs
- Removing even crossings
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- A Turán-type theorem on chords of a convex polygon
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On grids in topological graphs
- Graphs That Admit Polyline Drawings with Few Crossing Angles
- Research Problems in Discrete Geometry
- Applications of a New Separator Theorem for String Graphs
- Toward a theory of crossing numbers
This page was built for publication: On the Size of Planarly Connected Crossing Graphs