Pólya's permanent problem.
McCuaig, William (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “On the dimer problem and the Ising problem in finite 3-dimensional lattices.”
Pólya's permanent problem.
The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Existence of perfect matchings in a plane bipartite graph
Zhongyuan Che (2010)
Czechoslovak Mathematical Journal
Similarity:
We give a necessary and sufficient condition for the existence of perfect matchings in a plane bipartite graph in terms of elementary edge-cut, which extends the result for the existence of perfect matchings in a hexagonal system given in the paper of F. Zhang, R. Chen and X. Guo (1985).
Acyclic chromatic index of a subdivided graph
Jozef Fiamčík (1984)
Archivum Mathematicum
Similarity:
Permanents, Pfaffian orientations, and even directed circuits.
Robertson, Neil, Seymour, P.D., Thomas, Robin (1999)
Annals of Mathematics. Second Series
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...
On a problem of P. Vestergaard concerning circuits in graphs
Bohdan Zelinka (1987)
Czechoslovak Mathematical Journal
Similarity:
Equitable colorations of graphs
D. de Werra (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
Similarity: