The left-right planarity test is a method used in graph drawing and computational geometry to determine whether a given graph can be drawn in a plane without edge crossings, specifically in a way that respects a certain left-right ordering of the vertices. In the context of embedded planar graphs, the left-right planarity test deals with directed graphs (digraphs) and attempts to find a planar embedding of the graph such that: 1. Each vertex is placed on a horizontal line.

Ancestors (6)

  1. Topological graph theory
  2. Algebraic topology
  3. Fields of abstract algebra
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version