Skip to content

Topological Graph Theory

← Back to Domain-Specific Abstractions by Domain

3 domain-specific abstractions whose origin domain is Topological Graph Theory.

  • Crossing number (graph theory) — The minimum number of edge intersections over all plane drawings of a graph under a specified crossing convention.
  • Hanani–Tutte theorem — A planarity theorem stating that a graph is planar when it has a plane drawing in which every pair of independent edges crosses an even number of times.
  • Thickness (graph theory) — The minimum number of planar spanning subgraphs needed to partition a graph's edge set.