Beyond planar graphs: introduction
From MaRDI portal
Recommendations
- Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
- Quantitative restrictions on crossing patterns
- Crossing Numbers of Beyond-Planar Graphs Revisited
- \(k\)-planar graphs
- Crossing numbers of beyond-planar graphs
Cites work
- 1-planarity of graphs with a rotation system
- 2-layer right angle crossing drawings
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for testing full outer-2-planarity
- A linear-time algorithm for testing outer-1-planarity
- 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
- Beyond outerplanarity
- Circular right-angle crossing drawings in linear time
- Drawing graphs with right angle crossings
- Embedding-preserving rectangle visibility representations of nonplanar graphs
- Fan-planarity: properties and complexity
- Fáry's theorem for 1-planar graphs
- Gap-planar graphs
- Graphs drawn with few crossings per edge
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 3900784 (Why is no real title available?)
- scientific article; zbMATH DE number 3047038 (Why is no real title available?)
- On properties of maximal 1-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
- Optimal 1-planar graphs which triangulate other surfaces
- Outer 1-planar graphs
- Parameterized complexity of 1-planarity
- Polyline drawings with topological constraints
- Quasi-planar graphs have a linear number of edges
- 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
- Right angle crossing graphs and 1-planarity
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Straight-Line Drawability of a Planar Graph Plus an Edge
- The number of edges in k-quasi-planar graphs
- The straight-line RAC drawing problem is NP-hard
- The structure of 1-planar graphs
Cited in
(16)- Simplifying non-simple fan-planar drawings
- Optimal-area visibility representations of outer-1-plane graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- A first order logic definition of beyond-planar graphs
- Quantitative restrictions on crossing patterns
- Beyond-planarity: Turán-type results for non-planar bipartite graphs
- Beyond planar graphs. Communications of National Institute of Informatics (NII) Shonan meetings, Shonan, Japan, November 27 -- December 1, 2016
- Efficient generation of different topological representations of graphs beyond-planarity
- On the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphs
- The thickness of fan-planar graphs is at most three
- On optimal beyond-planar graphs
- Nonplanar Graph Drawings with k Vertices per Face
- Drawing graphs with k vertices per face: complexity and algorithms
- On the complexity of recognizing k^+-real face graphs
- Simple realizability of abstract topological graphs
This page was built for publication: Beyond planar graphs: introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001653)
