Skip to main content
SpringerLink
Log in

Perfect Matchings of Generalized Polyomino Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In this paper necessary and sufficient conditions are given for a generalized polyomino graph to have a perfect matching and to be elementary, respectively.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

  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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics, College of Management, Fuzhou University, Fuzhou, Fujian, P.R. China

    Chen Rong Si

  2. Center for Discrete Mathematics and Theoretical Computer Science, Fuzhou University, Fuzhou, Fujian, P.R. China

    Chen Rong Si

Authors
  1. Chen Rong Si
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chen Rong Si.

Additional information

The project was supported financially by National Natural Science Foundation of China (10431020).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Si, C. Perfect Matchings of Generalized Polyomino Graphs. Graphs and Combinatorics 21, 515–529 (2005). https://doi.org/10.1007/s00373-005-0624-1

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-005-0624-1

Keywords

Search

Navigation