Quantitative restrictions on crossing patterns

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

Recommendations

Beyond planar graphs: introduction
Crossing numbers of beyond-planar graphs
\(k\)-planar graphs
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
Gap-planar graphs

Cites work

1-planarity of graphs with a rotation system
\(\mathsf{NIC}\)-planar graphs
A crossing lemma for multigraphs
A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
A lower bound on the diameter of the flip graph
A new planarity test
A new proof of the 6 color theorem
A note on 1-planar graphs
Adding one edge to planar graphs makes crossing number and 1-planarity hard
Algorithms for graphs embeddable with few crossings per edge
An annotated bibliography on 1-planarity
Applications of a new separator theorem for string graphs
Applications of the crossing number
Arc diagrams, flip distances, and Hamiltonian triangulations
Bemerkungen zu einem Sechsfarbenproblem von G. Ringel
Coloring curves that cross a fixed curve
Coloring intersection graphs of arcwise connected sets in the plane
Colouring arcwise connected sets in the plane. I
Construction of locally plane graphs with many edges
Crossing Numbers and Hard Erdős Problems in Discrete Geometry
Crossing numbers of graphs
Crossing Stars in Topological Graphs
Defective colouring of graphs excluding a subgraph or minor
Drawing graphs in the plane with a prescribed outer face and polynomial area
Edges and switches, tunnels and bridges
Efficient Planarity Testing
Ein Sechsfarbenproblem auf der Kugel
Enumeration of simple complete topological graphs
Fáry's theorem for 1-planar graphs
Gap-Planar Graphs
Geometric graphs with no self-intersecting path of length three
Graphs drawn with few crossings per edge
scientific article; zbMATH DE number 3900784 (Why is no real title available?)
scientific article; zbMATH DE number 2145240 (Why is no real title available?)
scientific article; zbMATH DE number 5019924 (Why is no real title available?)
scientific article; zbMATH DE number 5037083 (Why is no real title available?)
Improvements on the density of maximal 1-planar graphs
Improving the crossing lemma by finding more crossings in sparse graphs
Inserting an edge into a geometric embedding
Mondshein sequences (a.k.a. (2,1)-orders)
On edges crossing few other edges in simple topological complete graphs
On grids in topological graphs
On Optimal 2- and 3-Planar Graphs
On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
On the density of maximal 1-planar 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 size of planarly connected crossing graphs
On topological graphs with at most four crossings per edge
Parameterized complexity of 1-planarity
Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
Recognizing optimal 1-planar graphs in linear time
Rectilinear drawings of graphs
Saturated simple and 2-simple topological graphs with few edges
Saturated simple and \(k\)-simple topological graphs
Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
Simple realizability of complete abstract topological graphs simplified
Structure of graphs with locally restricted crossings
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
The number of crossings in multigraphs with no empty lens
The rectilinear local crossing number of \(K_{n}\)
Tightening nonsimple paths and cycles on surfaces
Topological graphs with no large grids
Unified Hanani-Tutte theorem

Cited in

(4)

A first order logic definition of beyond-planar graphs
Beyond planar graphs: introduction
Efficient generation of different topological representations of graphs beyond-planarity
Crossing patterns of segments

This page was built for publication: Quantitative restrictions on crossing patterns

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