Left-right planarity test

Known as: Fraysseix-Rosenstiehl planarity criterion, Fraysseix–Rosenstiehl's planarity criterion, Fraysseix-Rosenstiehl's planarity criterion

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

Papers overview

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

2016

We show that c-planarity is solvable in a polynomial time for flat clustered graphs with three clusters if the combinatorial…

2014

The tree of decomposition of a $k$-connected graph by a set $\mathfrak S$ of pairwise independent $k$-vertex cutsets is defined…

2012

2 Embedding graphs into planarity 3 2.1 embedding algorithms donot use PQ-trees…

2012

2012

Motivated by his studies in knot theory V. Vassiliev introduced $X$-graphs as regular 4-valent graph with a structure of pairs of…

2006

We present a characterization of the c-planarity of c-connected clustered graphs. The characterization is based on the interplay…

2003

We can visualize a graph by producing a geometric representation of the graph in which each node is represented by a single point…

2002

Chemical mechanical planarization (CMP) is the polishing process enabled by both chemical and mechanical actions. CMP is used in…

1999

In a recent paper [1] Borghese et al., demonstrated that 4D pelvis-thigh-shank-foot cyclograms of human locomotion are…

1995

In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This…