Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,849,641 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Clique (graph theory)
Clique-sum
Forbidden graph characterization
Graph (discrete mathematics)
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Elementary Results on Forbidden Minors
Arnold Tan Junhan
2019
Corpus ID: 119333264
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…
Expand
2012
2012
Low-temperature study of magnetic properties of two-dimensional (2d) classical square Heisenberg lattices
J. Curély
International Conference on Optimization of…
2012
Corpus ID: 30251875
We start this article by recalling rigorous results previously obtained for 2d square lattices composed of (2N+1)2 classical…
Expand
2010
2010
Study of the magnetic properties of two-dimensional (2D) classical square heisenberg antiferromagnets II- spin correlations and susceptibility
J. Curély
International Conference on Optimization of…
2010
Corpus ID: 1936092
In this part labelled II we examine the spin correlations and the susceptibility. We use a similar method which has allowed to…
Expand
2010
2010
Magnetic properties of two-dimensional (2D) classical square Heisenberg lattices I- zero-field partition function
J. Curély
International Conference on Optimization of…
2010
Corpus ID: 8408665
In this part labelled I we rigorously examine 2D square lattices composed of (2N+1)<sup>2</sup> classical spins isotropically…
Expand
2004
2004
Аналог теоремы Вагнера о разложениях алгебры матриц@@@An analogue of Wagner's theorem for decompositions of matrix algebras
Дмитрий Николаевич Иванов
,
D. Ivanov
2004
Corpus ID: 124843120
1993
1993
Wagner's theorem and combinatorial enumeration of 3-polytopes(Computational Geometry and Discrete Geometry)
A. Deza
,
K. Fukuda
,
V. Rosta
1993
Corpus ID: 116915417
1983
1983
Rationality as weighted averaging
K. Lehrer
Synthese
1983
Corpus ID: 46954820
Weighted averaging is a method for aggregating the totality of information, both regimented and unregimented, possessed by an…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE