Skip to search formSkip to main contentSkip to account menu

Wagner's theorem

In graph theory, Wagner's theorem is a mathematical forbidden graph characterization of planar graphs, named after Klaus Wagner, stating that a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Clique (graph theory)Clique-sumForbidden graph characterizationGraph (discrete mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Elementary Results on Forbidden Minors
We start by building up some theory to state Wagner's Theorem, and then prove it using Kuratowski's Theorem, a proof of which is… 
2004
2004
Аналог теоремы Вагнера о разложениях алгебры матриц@@@An analogue of Wagner's theorem for decompositions of matrix algebras
1993
1993
Wagner's theorem and combinatorial enumeration of 3-polytopes(Computational Geometry and Discrete Geometry)