On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Loebl, Martin (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Existence of perfect matchings in a plane bipartite graph”
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Algorithmic aspects of bipartite graphs.
Bakonyi, Mihály, Varness, Erik M. (1995)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Permanents, Pfaffian orientations, and even directed circuits.
Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)
Annals of Mathematics. Second Series
Similarity:
Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the number of dissimilar pfaffian orientations of graphs
Marcelo H. de Carvalho, Cláudio L. Lucchesi, U. S. R. Murty (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Matchings in infinite graphs
P. J. McCarthy (1978)
Czechoslovak Mathematical Journal
Similarity: