A linear-time algorithm for testing full outer-2-planarity
type: Item
instance of: scholarly article
title: A linear-time algorithm for testing full outer-2-planarity
zbMATH Open document ID: 1405.05036
author: Seok-Hee Hong
author: Hiroshi Nagamochi
published in: Discrete Applied Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7027139
zbMATH Keywords: full-outer-2-planar graphs
MaRDI profile type: Publication
full work available at URL: j.dam.2018.08.018
OpenAlex ID: W2898765768
cites work: On the maximum number of edges in topological graphs with no four pairwise crossing edges
cites work: Quasi-planar graphs have a linear number of edges
cites work: The Straight-Line RAC Drawing Problem is NP-Hard
cites work: Parameterized Complexity of 1-Planarity
cites work: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs
cites work: Fan-planarity: properties and complexity
cites work: On the Number of Edges of Fan-Crossing Free Graphs
cites work: On-Line Planarity Testing
cites work: Drawing graphs with right angle crossings
cites work: A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system
cites work: Straight-Line Drawability of a Planar Graph Plus an Edge
cites work: Q3699704
cites work: Q5786239
cites work: The Number of Edges in $k$-Quasi-planar Graphs
cites work: Q4198056
cites work: Algorithms for graphs embeddable with few crossings per edge
cites work: Q4472293
cites work: A linear-time algorithm for testing outer-1-planarity
cites work: Fáry’s Theorem for 1-Planar Graphs
cites work: Testing Full Outer-2-planarity in Linear Time
cites work: Efficient Planarity Testing
cites work: Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
cites work: Graphs drawn with few crossings per edge
cites work: New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
cites work: Rectilinear drawings of graphs
DOI: 10.1016/J.DAM.2018.08.018
description: scientific article; zbMATH DE number 7027139