Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar

DOI10.1016/j.jctb.2019.08.006zbMath1436.05031arXiv1909.00223OpenAlexW3105254162MaRDI QIDQ1985441

Yanyan Li

Publication date: 7 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.00223

zbMATH Keywords

graph drawingtopological graphs\(k\)-quasiplanar graphs\(k\)-planar graphsbeyond planarity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

Simplifying Non-Simple Fan-Planar Drawings ⋮ Fan-crossing free graphs and their relationship to other beyond-planar graphs ⋮ The family of fan-planar graphs ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Beyond Planar Graphs: Introduction ⋮ Quantitative Restrictions on Crossing Patterns ⋮ 2-Layer k-Planar Graphs

Cites Work

• Recognizing and drawing IC-planar graphs
• 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
• A Turán-type theorem on chords of a convex polygon
• Graphs drawn with few crossings per edge
• 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
• Applications of the crossing number
• Right angle crossing graphs and 1-planarity
• On grids in topological graphs
• Fan-planarity: properties and complexity
• Topological graphs with no large grids
• On the Number of Edges of Fan-Crossing Free Graphs
• On the Density of Non-simple 3-Planar Graphs
• Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
• Coloring k _k -free intersection graphs of geometric objects in the plane
• On Optimal 2- and 3-Planar Graphs
• Two-Planar Graphs Are Quasiplanar
• The Number of Edges in $k$-Quasi-planar Graphs
• Discrete and Computational Geometry

This page was built for publication: Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar