Quasi-planar Graphs
From MaRDI portal
Publication:5001655
DOI10.1007/978-981-15-6533-5_3OpenAlexW3091658153MaRDI QIDQ5001655
Publication date: 22 July 2021
Published in: Beyond Planar Graphs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-981-15-6533-5_3
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (2)
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Crossing numbers of beyond-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convex geometric \((k+2)\)-quasiplanar representations of semi-bar \(k\)-visibility graphs
- Triangle-free intersection graphs of line segments with large chromatic number
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- Excluded permutation matrices and the Stanley-Wilf conjecture
- Drawing graphs with right angle crossings
- How to draw a planar graph on a grid
- On the maximum number of edges in quasi-planar graphs
- 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
- On the chromatic number of multiple interval graphs and overlap graphs
- A Turán-type theorem on chords of a convex polygon
- Graphs drawn with few crossings per edge
- Generalized Davenport-Schinzel sequences
- Quasi-planar graphs have a linear number of edges
- On geometric graphs with no \(k\) pairwise parallel edges
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Gap-planar graphs
- On line arrangements in the hyperbolic plane
- Applications of the crossing number
- A generalization of diagonal flips in a convex polygon
- The QuaSEFE problem
- Coloring curves that cross a fixed curve
- Thickness and coarseness of graphs
- Extensions of the linear bound in the Füredi-Hajnal conjecture
- Planar and Quasi Planar Simultaneous Geometric Embedding
- Bar 1-Visibility Graphs and their relation to other Nearly Planar Graphs
- On the Size of Planarly Connected Crossing Graphs
- On a Tree and a Path with no Geometric Simultaneous Embedding
- Crossing-Free Subgraphs
- On Optimal 2- and 3-Planar Graphs
- Beyond Outerplanarity
- Two-Planar Graphs Are Quasiplanar
- Planar Graphs Have Bounded Queue-Number
- h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area
- The Number of Edges in $k$-Quasi-planar Graphs
- Bar k-Visibility Graphs
- Applications of a New Separator Theorem for String Graphs
- Characterization of Unlabeled Level Planar Graphs
- On the thickness of the complete graph
- Discrete and Computational Geometry
- Embedding planar graphs at fixed vertex locations
This page was built for publication: Quasi-planar Graphs
