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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
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… 
2012
2012
We start this article by recalling rigorous results previously obtained for 2d square lattices composed of (2N+1)2 classical… 
2010
2010
In this part labelled II we examine the spin correlations and the susceptibility. We use a similar method which has allowed to… 
2010
2010
In this part labelled I we rigorously examine 2D square lattices composed of (2N+1)<sup>2</sup> classical spins isotropically… 
1983
1983
Weighted averaging is a method for aggregating the totality of information, both regimented and unregimented, possessed by an…