Two-Planar Graphs Are Quasiplanar
From MaRDI portal
Publication:5111262
DOI10.4230/LIPIcs.MFCS.2017.47zbMath1441.68187arXiv1705.05569OpenAlexW2963074221MaRDI QIDQ5111262
No author found.
Publication date: 26 May 2020
Full work available at URL: https://arxiv.org/abs/1705.05569
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (9)
Combinatorial properties and recognition of unit square visibility graphs ⋮ Gap-Planar Graphs ⋮ Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar ⋮ Two-Planar Graphs Are Quasiplanar ⋮ Unnamed Item ⋮ Gap-planar graphs ⋮ Quasi-planar Graphs ⋮ $$\textit{\textbf{k}}$$-Planar Graphs ⋮ Fan-Planar Graphs
Cites Work
- Unnamed Item
- Recognizing and drawing IC-planar graphs
- Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
- On graph thickness, geometric thickness, and separator theorems
- Improving the crossing lemma by finding more crossings in sparse graphs
- 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
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Applications of the crossing number
- On topological graphs with at most four crossings per edge
- An annotated bibliography on 1-planarity
- Graph minor theory
- Crossing-Free Subgraphs
- On Optimal 2- and 3-Planar Graphs
- Two-Planar Graphs Are Quasiplanar
- The Number of Edges in $k$-Quasi-planar Graphs
- Applications of a New Separator Theorem for String Graphs
- Adjacent Crossings Do Matter
This page was built for publication: Two-Planar Graphs Are Quasiplanar
