On the maximum number of edges in quasi-planar graphs
From MaRDI portal
Publication:878960
DOI10.1016/J.JCTA.2006.08.002zbMATH Open1120.05045OpenAlexW1967421215MaRDI QIDQ878960FDOQ878960
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
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Every planar map is four colorable. I: Discharging
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- A Turán-type theorem on chords of a convex polygon
- Title not available (Why is that?)
- Discrete and Computational Geometry
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Topological graphs with no large grids
- Construction of Locally Plane Graphs with Many Edges
- Title not available (Why is that?)
- Crossing Stars in Topological Graphs
Cited In (56)
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Min-\(k\)-planar drawings of graphs
- Plane multigraphs with one-bend and circular-arc edges of a fixed angle
- Min-\(k\)-planar drawings of graphs
- Nonplanar Graph Drawings with k Vertices per Face
- General penny graphs are at most \(\frac{43}{18}\)-dense
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Drawing Graphs with Right Angle Crossings
- The density of fan-planar graphs
- Beyond Outerplanarity
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- On the number of edges of quadrilateral-free graphs
- Crossing numbers of beyond-planar graphs
- Graphs that admit right angle crossing drawings
- Quasi-planar Graphs
- Two-Planar Graphs Are Quasiplanar
- Simplifying non-simple fan-planar drawings
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- On fan-crossing graphs
- Title not available (Why is that?)
- Recognizing and drawing IC-planar graphs
- Quantitative Restrictions on Crossing Patterns
- Drawing graphs with right angle crossings
- Simplifying Non-Simple Fan-Planar Drawings
- 2-Layer k-Planar Graphs
- Discrete and Computational Geometry
- Planar point sets determine many pairwise crossing segments
- Graphs that admit right angle crossing drawings
- Gap-Planar Graphs
- On topological graphs with at most four crossings per edge
- The maximum number of edges in geometric graphs with pairwise virtually avoiding edges
- An upper bound on the number of edges in an almost planar bipartite graph
- Graphs with large total angular resolution
- Title not available (Why is that?)
- Extremal problems on triangle areas in two and three dimensions
- Grid obstacle representation of graphs
- Counting Plane Graphs: Cross-Graph Charging Schemes
- Gap-planar graphs
- On RAC drawings of graphs with one bend per edge
- Graphs with large total angular resolution
- On the Size of Planarly Connected Crossing Graphs
- Fan-planarity: properties and complexity
- \(\mathsf{NIC}\)-planar graphs
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- On RAC drawings of graphs with one bend per edge
- Fan-Planar Graphs
- Multitriangulations as complexes of star polygons
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- The family of fan-planar graphs
- 1-fan-bundle-planar drawings of graphs
- Efficient Generation of Different Topological Representations of Graphs Beyond-Planarity
- Efficient generation of different topological representations of graphs beyond-planarity
- The QuaSEFE problem
- k-Quasi-Planar Graphs
This page was built for publication: On the maximum number of edges in quasi-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878960)
