Recommendations
Cites work
- scientific article; zbMATH DE number 3604926 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3394160 (Why is no real title available?)
- 1-planarity of graphs with a rotation system
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for testing outer-1-planarity
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Algorithms for graphs embeddable with few crossings per edge
- An annotated bibliography on 1-planarity
- Circular right-angle crossing drawings in linear time
- Crossing Number is NP-Complete
- Edges and switches, tunnels and bridges
- Fan-planarity: properties and complexity
- Gap-Planar Graphs
- Graphs drawn with few crossings per edge
- Guest Editors' Foreword and Overview
- Improving the crossing lemma by finding more crossings in sparse graphs
- Minimizing maximum indegree
- On a problem of P. Turan concerning graphs
- On the Size of Planarly Connected Crossing Graphs
- On the density of non-simple 3-planar graphs
- On the maximum number of edges in quasi-planar graphs
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Outer 1-planar graphs
- Progress on partial edge drawings
- Quasi-planar graphs have a linear number of edges
- Structure of graphs with locally restricted crossings
- Testing Full Outer-2-planarity in Linear Time
- The crossing number of K5,n
- The crossing-angle resolution in graph drawing
- The number of edges in \(k\)-quasi-planar graphs
- Two-Planar Graphs Are Quasiplanar
Cited in
(28)- Edge-minimum saturated \(k\)-planar drawings
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- On RAC drawings of graphs with one bend per edge
- Crossing Layout in Non-planar Graph Drawings
- Efficient generation of different topological representations of graphs beyond-planarity
- Tree densities in sparse graph classes
- Simplifying non-simple fan-planar drawings
- On optimal beyond-planar graphs
- Testing gap \(k\)-planarity is NP-complete
- Efficient generation of different topological representations of graphs beyond-planarity
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- Gap-Planar Graphs
- Flow-Cut Gaps and Face Covers in Planar Graphs
- Crossing Numbers of Beyond-Planar Graphs Revisited
- Quasi-planar Graphs
- Fan-planar graphs
- Quantitative restrictions on crossing patterns
- \(k\)-planar graphs
- Treewidth, Circle Graphs, and Circular Drawings
- Beyond planar graphs: introduction
- Simplifying Non-Simple Fan-Planar Drawings
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Treewidth, circle graphs and circular drawings
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Min-\(k\)-planar drawings of graphs
- On RAC drawings of graphs with two bends per edge
- Min-\(k\)-planar drawings of graphs
- On RAC drawings of graphs with two bends per edge
This page was built for publication: Gap-planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1786592)
