Gap-Planar Graphs
From MaRDI portal
Publication:4625141
DOI10.1007/978-3-319-73915-1_41zbMath1503.68203arXiv1708.07653OpenAlexW3022373642MaRDI QIDQ4625141
Fabrizio Montecchiani, Luca Grilli, Kord Eickmeyer, Ignaz Rutter, Jean-François Baffier, Sang Won Bae, Jinhee Chun, Seok-Hee Hong, Peter Eades, Matias Korman, Csaba D. Tóth
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.07653
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (5)
1-fan-bundle-planar drawings of graphs ⋮ Gap-Planar Graphs ⋮ On RAC drawings of graphs with one bend per edge ⋮ Gap-planar graphs ⋮ Quantitative Restrictions on Crossing Patterns
Cites Work
- Unnamed Item
- Unnamed Item
- Outer 1-planar graphs
- Recognizing and drawing IC-planar graphs
- Circular right-angle crossing drawings in linear time
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- A linear-time algorithm for testing outer-1-planarity
- Improving the crossing lemma by finding more crossings in sparse graphs
- On the maximum number of edges in quasi-planar graphs
- Edges and switches, tunnels and bridges
- Graphs drawn with few crossings per edge
- Quasi-planar graphs have a linear number of edges
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Minimizing maximum indegree
- The density of fan-planar graphs
- Fan-planarity: properties and complexity
- On RAC drawings of 1-planar graphs
- An annotated bibliography on 1-planarity
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- Algorithms for graphs embeddable with few crossings per edge
- Testing Full Outer-2-planarity in Linear Time
- On the Number of Edges of Fan-Crossing Free Graphs
- On the Size of Planarly Connected Crossing Graphs
- On the Density of Non-simple 3-Planar Graphs
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Gap-Planar Graphs
- Progress on Partial Edge Drawings
- Two-Planar Graphs Are Quasiplanar
- 1-Planarity of Graphs with a Rotation System
- The Number of Edges in $k$-Quasi-planar Graphs
- The crossing number of K5,n
- On a problem of P. Turan concerning graphs
This page was built for publication: Gap-Planar Graphs
