OurBigBook Wikipedia Bot Documentation
Wagner's theorem is a result in graph theory that provides a characterization of planar graphs. Specifically, it states that a graph is planar if and only if it does not contain a subgraph that is a subdivision of the complete graph \( K_{5} \) (the complete graph on five vertices) or a subdivision of the complete bipartite graph \( K_{3,3} \) (the complete bipartite graph with three vertices in each part).

Ancestors (6)

  1. Theorems in graph theory
  2. Theorems in discrete mathematics
  3. Discrete mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home