Gap-planar graphs
DOI10.1016/J.TCS.2018.05.029zbMATH Open1400.68151OpenAlexW2749514451MaRDI QIDQ1786592FDOQ1786592
Authors: Sang Won Bae, Jinhee Chun, Peter Eades, Kord Eickmeyer, Luca Grilli, Seok-Hee Hong, Matias Korman, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth, Jean-François Baffier 
Publication date: 24 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.05.029
Recommendations
recognition problemcomplete graphs\(k\)-quasiplanar graphsdensity results\(k\)-planar graphsbeyond planarity \(k\)-gap-planar graphs
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Minimizing maximum indegree
- Title not available (Why is that?)
- Graphs drawn with few crossings per edge
- Improving the crossing lemma by finding more crossings in sparse graphs
- Crossing Number is NP-Complete
- Outer 1-planar graphs
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
- 1-planarity of graphs with a rotation system
- Quasi-planar graphs have a linear number of edges
- Algorithms for graphs embeddable with few crossings per edge
- The crossing-angle resolution in graph drawing
- The number of edges in \(k\)-quasi-planar graphs
- On the maximum number of edges in quasi-planar graphs
- Circular right-angle crossing drawings in linear time
- A linear-time algorithm for testing outer-1-planarity
- The crossing number of K5,n
- Title not available (Why is that?)
- On the density of non-simple 3-planar graphs
- On a problem of P. Turan concerning graphs
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- An annotated bibliography on 1-planarity
- Structure of graphs with locally restricted crossings
- Edges and switches, tunnels and bridges
- On the recognition of fan-planar and maximal outer-fan-planar graphs
- On the Size of Planarly Connected Crossing Graphs
- Fan-planarity: properties and complexity
- On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
- Gap-Planar Graphs
- Testing Full Outer-2-planarity in Linear Time
- Guest Editors' Foreword and Overview
- Two-Planar Graphs Are Quasiplanar
- Progress on partial edge drawings
Cited In (28)
- Simple \(k\)-planar graphs are simple \((k + 1)\)-quasiplanar
- 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
- Fan-planar graphs
- Quasi-planar Graphs
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Simplifying non-simple fan-planar drawings
- Edge-minimum saturated \(k\)-planar drawings
- Efficient generation of different topological representations of graphs beyond-planarity
- Tree densities in sparse graph classes
- Testing gap \(k\)-planarity is NP-complete
- Simplifying Non-Simple Fan-Planar Drawings
- Beyond planar graphs: introduction
- Min-\(k\)-planar drawings of graphs
- On RAC drawings of graphs with two bends per edge
- Gap-Planar Graphs
- Treewidth, Circle Graphs, and Circular Drawings
- Treewidth, circle graphs and circular drawings
- On RAC drawings of graphs with one bend per edge
- Quantitative restrictions on crossing patterns
- \(k\)-planar graphs
- Flow-Cut Gaps and Face Covers in Planar Graphs
- Crossing Layout in Non-planar Graph Drawings
- On optimal beyond-planar graphs
- Efficient generation of different topological representations of graphs beyond-planarity
- Crossing Numbers of Beyond-Planar Graphs Revisited
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
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)
