On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)
Annals of Mathematics. Second Series
Similarity:
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
P. J. McCarthy (1978)
Czechoslovak Mathematical Journal
Similarity:
Gallucio, Anna, Loebl, Martin (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Sana Javed, Mujtaba Hussain, Ayesha Riasat, Salma Kanwal, Mariam Imtiaz, M. O. Ahmad (2017)
Open Mathematics
Similarity:
An edge-magic total labeling of an (n,m)-graph G = (V,E) is a one to one map λ from V(G) ∪ E(G) onto the integers {1,2,…,n + m} with the property that there exists an integer constant c such that λ(x) + λ(y) + λ(xy) = c for any xy ∈ E(G). It is called super edge-magic total labeling if λ (V(G)) = {1,2,…,n}. Furthermore, if G has no super edge-magic total labeling, then the minimum number of vertices added to G to have a super edge-magic total labeling, called super edge-magic deficiency...