# Planarity

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Graph Drawing
- 2016

In this paper we settle the computational complexity of two open problems related to the extension of the notion of level… (More)

Is this relevant?

2011

2011

- 23rd International Teletraffic Congress (ITC)
- 2011

A planar graph is one that can be drawn (say on a piece of paper) without any crossing links. In this paper we show, using a new… (More)

Is this relevant?

2009

2009

- 2009

Complexity in product design, e.g. in product architectures or process structures, continuously increases. To properly evaluate a… (More)

Is this relevant?

2008

2008

- 2008

We give a linear-time planarity test that unifies and simplifies the algorithms of Shih and Hsu and Boyer and Myrvold; in our… (More)

Is this relevant?

2007

2007

- 2007

The question of which groups admit planar Cayley graphs goes back over 100 years, being settled for finite groups by Maschke in… (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- J. Graph Algorithms Appl.
- 2004

We present new O(n)-time methods for planar embedding and Kuratowski subgraph isolation that were inspired by the Booth-Lueker PQ… (More)

Is this relevant?

2004

2004

- SOFSEM
- 2004

Planarity is an important concept in graph drawing. It is generally accepted that planar drawings are well understandable… (More)

Is this relevant?

2001

2001

- Algorithmica
- 2001

An upward planar drawing of a directed graph (digraph) is a planar drawing such that all the edges are represented by curves… (More)

Is this relevant?

Highly Cited

1980

Highly Cited

1980

- J. Comb. Theory, Ser. B
- 1980

We present a short proof of the following theorems simultaneously: Kuratowski’s theorem, Fary’s theorem, and the theorem of Tutte… (More)

Is this relevant?

1975

1975

- J. ACM
- 1975

An algorithm is presented which either directly establishes the nonplanarity of a graph G or completes G to a locally Hamiltonian… (More)

Is this relevant?