On the maximum number of edges in quasi-planar graphs
From MaRDI portal
Publication:878960
DOI10.1016/j.jcta.2006.08.002zbMath1120.05045OpenAlexW1967421215MaRDI QIDQ878960
Publication date: 4 May 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2006.08.002
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (47)
The density of fan-planar graphs ⋮ Simplifying Non-Simple Fan-Planar Drawings ⋮ Recognizing and drawing IC-planar graphs ⋮ Drawing Graphs with Right Angle Crossings ⋮ Simplifying non-simple fan-planar drawings ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ On topological graphs with at most four crossings per edge ⋮ Grid obstacle representation of graphs ⋮ \(\mathsf{NIC}\)-planar graphs ⋮ k-Quasi-Planar Graphs ⋮ The family of fan-planar graphs ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Graphs that admit right angle crossing drawings ⋮ On the Size of Planarly Connected Crossing Graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ On fan-crossing graphs ⋮ Efficient generation of different topological representations of graphs beyond-planarity ⋮ The QuaSEFE problem ⋮ 1-fan-bundle-planar drawings of graphs ⋮ Unnamed Item ⋮ Counting Plane Graphs: Cross-Graph Charging Schemes ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ Gap-Planar Graphs ⋮ Beyond Outerplanarity ⋮ Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Two-Planar Graphs Are Quasiplanar ⋮ Drawing graphs with right angle crossings ⋮ Graphs that Admit Right Angle Crossing Drawings ⋮ On RAC drawings of graphs with one bend per edge ⋮ Gap-planar graphs ⋮ On RAC drawings of graphs with one bend per edge ⋮ Planar point sets determine many pairwise crossing segments ⋮ Crossing numbers of beyond-planar graphs ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ The maximum number of edges in geometric graphs with pairwise virtually avoiding edges ⋮ Graphs with large total angular resolution ⋮ An upper bound on the number of edges in an almost planar bipartite graph ⋮ On the maximum number of edges in topological graphs with no four pairwise crossing edges ⋮ Graphs with large total angular resolution ⋮ Multitriangulations as complexes of star polygons ⋮ Extremal problems on triangle areas in two and three dimensions ⋮ Quantitative Restrictions on Crossing Patterns ⋮ Quasi-planar Graphs ⋮ Fan-Planar Graphs ⋮ 2-Layer k-Planar Graphs ⋮ Fan-planarity: properties and complexity
Cites Work
- A Turán-type theorem on chords of a convex polygon
- Every planar map is four colorable. I: Discharging
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- Topological graphs with no large grids
- Construction of Locally Plane Graphs with Many Edges
- Crossing Stars in Topological Graphs
- Discrete and Computational Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the maximum number of edges in quasi-planar graphs
