zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Perfect matchings of generalized polyomino graphs. (English) Zbl 1089.05061
Summary: Necessary and sufficient conditions are given for a generalized polyomino graph to have a perfect matching and to be elementary, respectively.
MSC:
05C70Factorization, etc.
05B50Polyominoes
References:
[1]Lovász, L., Plummer, M.D.: Matching Theory (Annals of Discrete Mathematics 29). Amsterdam: North-Holland, 1986
[2]Plummer, M.D.: Matching Theory - a sampler: from Dénes Konig to the present. Discrete Math. 100, 177–219 (1992)
[3]Propp, J.: Enumeration of Matchings: Problems and Progress, MSRI Publications Vol 38, Cambridge Univ. Press, 1999, pp. 255–291
[4]Akiyama, J., Kano, M.: 1-factor of triangle graphs. In: Akiyama, J.: Number Theory and Combinatorics, World Scientific 1985, pp. 21–35
[5]Zhang, H.P., Zhang, F.J.: Perfect matchings of polyomino graphs. Graphs and Combinatorics 13, 295–304 (1997)
[6]Kostochka, A.V.: Proc. 30th Internat, Wiss, Koll TH Ilmenau. Vortragsreihe, E. 1985, pp. 49–52
[7]Zhang, F.J., Guo, X.F., Chen, R.S.: Perfect matchings in hexagonal systems. Graphs and Combinatorics 1, 383–386 (1985)
[8]Cyvin, S.J., Brunvoll, J., Cyvin, B.N., Chen, R.S., Zhang, F.J.: Theory of Coronoid Hydrocarbons II. Springer, Berlin Heidelberg, 1994
[9]Kasteleyn, P.W.: The statistics of dimer on a lattice I., The number of dimer arrangement on a quadratic lattice. Physica 27, 1209–1225 (1961)
[10]John, P., Sachs, H., Zerntic, H.: Counting perfect matchings in polyominoes with applications to the dimer problem. Zastosowania Matemetyki (Appl.math) 19, 465–477 (1987)
[11]Sachs, H.: Counting perfect matchings in lattice graphs, In: Topics in combinatorics and graph theory, Heidelberg: Physica-Verlag 1990, pp. 577–584
[12]Berge, C., Chen, C.C., Chvátal, V., Soaw, C.S.: Combinatorial properties of polyominoes. Combinatirica 1, 217–224 (1981)