Nonplanar Graph Drawings with k Vertices per Face

Cites work

scientific article; zbMATH DE number 3643294 (Why is no real title available?)
scientific article; zbMATH DE number 2123123 (Why is no real title available?)
scientific article; zbMATH DE number 3652373 (Why is no real title available?)
1-Planar Graphs
A linear-time algorithm for testing outer-1-planarity
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus
An annotated bibliography on 1-planarity
Area, curve complexity, and crossing resolution of non-planar graph drawings
Beyond planar graphs: introduction
Density of straight-line 1-planar graph drawings
Disjoint edges in geometric graphs
Drawing graphs with right angle crossings
Extremal \(H\)-free planar graphs
Fan-planarity: properties and complexity
Graphs drawn with few crossings per edge
Improving the crossing lemma by finding more crossings in sparse graphs
Notes on large angle crossing graphs
On Optimal 2- and 3-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 recognition of fan-planar and maximal outer-fan-planar graphs
On the size of graphs that admit polyline drawings with few bends and crossing angles
On topological graphs with at most four crossings per edge
Outer 1-planar graphs
Plane graphs with large faces and small diameter
Right Angle Crossing Drawings of Graphs
Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
Some geometric applications of Dilworth's theorem
The radius of k-connected planar graphs with bounded faces
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Über 1-optimale Graphen

Cited in

(2)

Min-\(k\)-planar drawings of graphs
Min-\(k\)-planar drawings of graphs

This page was built for publication: Nonplanar Graph Drawings with k Vertices per Face

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