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 “A reciprocity theorem for domino tilings.”
On the dimer problem and the Ising problem in finite 3-dimensional lattices.
Vector spaces and the Petersen graph.
de Carvalho, Marcelo H., Little, C.H.C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Decompositions of graphs into 5-cycles and other small graphs.
Sousa, Teresa (2005)
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:
Deficiency of forests
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...
An exploration of the permanent-determinant method.
Kuperberg, Greg (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
-decompositions of -graphs when is an -graph with exactly 2 edges.
Sousa, Teresa (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Cyclicity of a complete 3-equipartite graph
Bohdan Zelinka (1985)
Archivum Mathematicum
Similarity:
Characterization of magic graphs
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity: