Nonplanar Graph Drawings with k Vertices per Face

Cites Work

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

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)