Planar dual graph

A planar dual graph has one vertex in each face of a fixed planar embedding and one dual edge crossing each primal edge.

Table of contents
- Planar duality for rectangle crossings Planar dual graph

Planar duality for rectangle crossings

For a rectangle in a planar lattice, exactly one of an open primal left-to-right crossing and a closed dual top-to-bottom crossing occurs.

 Ancestors (6)

 Incoming links (1)

Past exam of the mathematics course of the University of Cambridge / 2026 / iii / Paper 212 / 1 / a / Solution

 View article source

 Discussion (0)

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