On the maximum number of edges in quasi-planar graphs
From MaRDI portal
(Redirected from Publication:878960)
Recommendations
Cites work
- scientific article; zbMATH DE number 66689 (Why is no real title available?)
- scientific article; zbMATH DE number 2145240 (Why is no real title available?)
- A Turán-type theorem on chords of a convex polygon
- Construction of locally plane graphs with many edges
- Crossing Stars in Topological Graphs
- Discrete and Computational Geometry
- Every planar map is four colorable. I: Discharging
- Graphs drawn with few crossings per edge
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Quasi-planar graphs have a linear number of edges
- Topological graphs with no large grids
Cited in
(57)- Counting plane graphs: cross-graph charging schemes
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Drawing Graphs with Right Angle Crossings
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- The density of fan-planar graphs
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Min-\(k\)-planar drawings of graphs
- On the number of edges of quadrilateral-free graphs
- Crossing numbers of beyond-planar graphs
- Graphs that admit right angle crossing drawings
- Plane multigraphs with one-bend and circular-arc edges of a fixed angle
- Fan-planar graphs
- Quasi-planar Graphs
- On the maximum number of edges in topological graphs with no four pairwise crossing edges
- Simplifying non-simple fan-planar drawings
- Two-Planar Graphs Are Quasiplanar
- On fan-crossing graphs
- \(h\)-quasi planar drawings of bounded treewidth graphs in linear area
- scientific article; zbMATH DE number 2145240 (Why is no real title available?)
- Drawing graphs with right angle crossings
- Efficient generation of different topological representations of graphs beyond-planarity
- Simplifying Non-Simple Fan-Planar Drawings
- 2-Layer k-Planar Graphs
- Discrete and Computational Geometry
- Min-\(k\)-planar drawings of graphs
- Graphs that admit right angle crossing drawings
- 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
- On topological graphs with at most four crossings per edge
- Gap-Planar Graphs
- Extremal problems on triangle areas in two and three dimensions
- Quasi-planar graphs have a linear number of edges
- Graphs with large total angular resolution
- Beyond outerplanarity
- Grid obstacle representation of graphs
- Gap-planar graphs
- On RAC drawings of graphs with one bend per edge
- On the Size of Planarly Connected Crossing Graphs
- Graphs with large total angular resolution
- The number of edges in \(k\)-quasi-planar graphs
- Fan-planarity: properties and complexity
- \(k\)-quasi-planar graphs
- \(\mathsf{NIC}\)-planar graphs
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- On RAC drawings of graphs with one bend per edge
- Nonplanar Graph Drawings with k Vertices per Face
- Quantitative restrictions on crossing patterns
- Multitriangulations as complexes of star polygons
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- General penny graphs are at most \(\frac{43}{18}\)-dense
- On the size of planarly connected crossing graphs
- The family of fan-planar graphs
- On optimal beyond-planar graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- The QuaSEFE problem
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)
