Gap-planar graphs
type: Item
instance of: scholarly article
title: Gap-planar graphs
zbMATH Open document ID: 1400.68151
author: Sang Won Bae
author: Jinhee Chun
author: Peter Eades
author: Kord Eickmeyer
author: Luca Grilli
author: Seok-Hee Hong
author: Matias Korman
author: Fabrizio Montecchiani
author: Ignaz Rutter
author: Csaba D. Tóth
author: Jean-François Baffier
published in: Theoretical Computer Science
publication date: 2018-09-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6942969
zbMATH Keywords: beyond planarity \(k\)-gap-planar graphs
zbMATH Keywords: density results
zbMATH Keywords: complete graphs
zbMATH Keywords: recognition problem
zbMATH Keywords: \(k\)-planar graphs
zbMATH Keywords: \(k\)-quasiplanar graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2018.05.029
OpenAlex ID: W2749514451
cites work: On the Size of Planarly Connected Crossing Graphs
cites work: On the maximum number of edges in quasi-planar graphs
cites work: Quasi-planar graphs have a linear number of edges
cites work: On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs
cites work: Outer 1-planar graphs
cites work: 1-Planarity of Graphs with a Rotation System
cites work: Gap-Planar Graphs
cites work: On the recognition of fan-planar and maximal outer-fan-planar graphs
cites work: On RAC drawings of 1-planar graphs
cites work: Guest Editors' Foreword and Overview
cites work: On the Density of Non-simple 3-Planar Graphs
cites work: Fan-planarity: properties and complexity
cites work: Recognizing and drawing IC-planar graphs
cites work: Progress on Partial Edge Drawings
cites work: On the Number of Edges of Fan-Crossing Free Graphs
cites work: Circular right-angle crossing drawings in linear time
cites work: The Crossing-Angle Resolution in Graph Drawing
cites work: Structure of Graphs with Locally Restricted Crossings
cites work: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
cites work: Edges and switches, tunnels and bridges
cites work: The Number of Edges in $k$-Quasi-planar Graphs
cites work: Q4170745
cites work: Q4198056
cites work: Crossing Number is NP-Complete
cites work: Algorithms for graphs embeddable with few crossings per edge
cites work: Q5661522
cites work: Two-Planar Graphs Are Quasiplanar
cites work: A linear-time algorithm for testing outer-1-planarity
cites work: Testing Full Outer-2-planarity in Linear Time
cites work: The crossing number of K5,n
cites work: An annotated bibliography on 1-planarity
cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
cites work: Improving the crossing lemma by finding more crossings in sparse graphs
cites work: Graphs drawn with few crossings per edge
cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
cites work: Minimizing maximum indegree
cites work: On a problem of P. Turan concerning graphs
DOI: 10.1016/J.TCS.2018.05.029
description: scientific article; zbMATH DE number 6942969