Planarity testing

Known as: Graph planarity 
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
In this paper we introduce and study the strip planarity testing problem, which takes as an input a planar graph G(V, E) and a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
2013
Universita’ di Roma Tre 3.1 Properties and Characterizations of Planar Graphs . . . . . 2 Basic Definitions • Properties… (More)
  • figure 3.1
  • figure 3.2
  • figure 3.3
  • figure 3.4
  • figure 3.5
Is this relevant?
2012
2012
A directed acyclic graph is upward planar if it allows a drawing without edge crossings where all edges are drawn as curves with… (More)
  • table 1
  • table 2
  • figure 1
Is this relevant?
2007
2007
In this paper we introduce cyclic level planar graphs, which are a planar version of the recurrent hierarchies from Sugiyama et… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A directed graph is upward planar if it can be drawn in the plane such that every edge is a monotonically increasing curve in the… (More)
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The on-line planarity-testing problem consists of performing the following operations on a planar graph G: (i) testing if a new… (More)
Is this relevant?
1989
1989
Using hierarchical definitions, one can describe very large graphs in small space. The blow-up from the length of the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1985
Highly Cited
1985
This paper presents a simple linear algorithm for embedding (or drawing) a planar graph in the plane. The algorithm is based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
A data structure called a PQ-tree is introduced. PQ-trees can be used to represent the permutations of a set U in which various… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1974
Highly Cited
1974
This paper describes an efficient algorithm to determine whether an arbitrary graph <italic>G</italic> can be embedded in the… (More)
  • figure 3
  • figure 8
  • figure 9
Is this relevant?