In graph theory, a branch of mathematics, the left-right planarity testor de Fraysseix–Rosenstiehl planarity criterion is a characterization of… (More)

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

2008

2008

We consider the class F of labelled 2-connected non-planar graphs without a K 3,3-subdivision that are embeddable in the… (More)

Is this relevant?

2007

2007

- Md. Abul Hassan Samee, Md. Saidur Rahman
- WALCOM
- 2007

An upward planar drawing of a digraph G is a planar drawing of G where every edge is drawn as a simple curve monotone in the… (More)

Is this relevant?

2006

2006

- Henning Bruhn, Maya Jakobine Stein
- J. Comb. Theory, Ser. B
- 2006

MacLane’s planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every… (More)

Is this relevant?

2005

2002

2002

- Jörg Sawollek
- 2002

A graph G is called minimalizable if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by… (More)

Is this relevant?

2000

2000

- org Sawollek
- 2000

A graph G is called minimalizable if a diagram with minimal crossing number can be obtained from an arbitrary diagram of G by… (More)

Is this relevant?

1998

1998

- Thomas Böhme, Jochen Harant, Anja Pruchnewski, Ingo Schiermeyer
- Discrete Mathematics
- 1998

We prove that a simple finite bipartite cubic non-planar graph contains a clean subdivision of K3.3. Here a subdivision of K3,3… (More)

Is this relevant?

Review

1995

Review

1995

- Ashim Garg, Roberto, TamassiaDepartment
- 1995

Acyclic digraphs, such as the covering digraphs of ordered sets, are usually drawn upward, i.e., with the edges monotonically… (More)

Is this relevant?

Highly Cited

1993

Highly Cited

1993

A digraph is upward planar if it has a planar drawing such that all the edges are monotone with respect to the vertical direction… (More)

Is this relevant?

1993