Quasi-planar Graphs

DOI10.1007/978-981-15-6533-5_3MaRDI QIDQ5001655zbMATH OpenOpenAlexFDO

Authors Eyal Ackerman

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

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• h-quasi planar drawings of bounded treewidth graphs in linear area
• A generalization of diagonal flips in a convex polygon
• A Turán-type theorem on chords of a convex polygon
• Applications of a new separator theorem for string graphs
• Applications of the crossing number
• Bar 1-visibility graphs and their relation to other nearly planar graphs
• Bar k-Visibility Graphs
• Beyond outerplanarity
• Characterization of Unlabeled Level Planar Graphs
• Coloring \(K_{k}\)-free intersection graphs of geometric objects in the plane
• Coloring curves that cross a fixed curve
• Convex geometric (k+2)-quasiplanar representations of semi-bar k-visibility graphs
• Crossing-Free Subgraphs
• Discrete and Computational Geometry
• Drawing graphs with right angle crossings
• Embedding planar graphs at fixed vertex locations
• Excluded permutation matrices and the Stanley-Wilf conjecture
• Extensions of the linear bound in the Füredi-Hajnal conjecture
• Gap-planar graphs
• Generalized Davenport-Schinzel sequences
• Graphs drawn with few crossings per edge
• How to draw a planar graph on a grid
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 66689 (Why is no real title available?)
• On a tree and a path with no geometric simultaneous embedding
• On geometric graphs with no k pairwise parallel edges
• On line arrangements in the hyperbolic plane
• On Optimal 2- and 3-Planar Graphs
• On the chromatic number of multiple interval graphs and overlap graphs
• On the maximum number of edges in quasi-planar graphs
• On the maximum number of edges in topological graphs with no four pairwise crossing edges
• On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
• On the Size of Planarly Connected Crossing Graphs
• On the thickness of the complete graph
• Planar and Quasi Planar Simultaneous Geometric Embedding
• Planar graphs have bounded queue-number
• Quasi-planar graphs have a linear number of edges
• The number of edges in k-quasi-planar graphs
• The QuaSEFE problem
• Thickness and coarseness of graphs
• Triangle-free intersection graphs of line segments with large chromatic number
• Two-Planar Graphs Are Quasiplanar

Cited in

(8)

• On Planar Quasi-Parity Graphs
• Quasimonotone graphs
• Crossing numbers of beyond-planar graphs
• Recognizing planar strict quasi-parity graphs
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
• Plane multigraphs with one-bend and circular-arc edges of a fixed angle
• Convex-geometric k-planar graphs are convex-geometric (k+1)-quasiplanar

This page was built for publication: Quasi-planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001655)