Perfect matchings in bipartite lattice animals: Lower bounds and realizability

Journal of Mathematical Chemistry

Volumn 38, Issue 4, 2005, Pages 617-627

  Došlić, Tomislav ^a  

^a UNIVERSITY OF ZAGREB   (Croatia)

Author keywords

Benzenoid graph; Lattice animal; Lower bound; Perfect matching; Polyomino; Realizability

Indexed keywords

EID: 33847632962     PISSN: 02599791     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10910-005-6915-1     Document Type: Article

References (8)

1. W.C. Shiu, P.C.B. Lam, F. Zhang and H. Zhang, J. Math. Chem. 31 (2002) 405.
2. P.C.B. Lam, W.C. Shiu and H. Zhang, MATCH 49 (2003) 127.
3. T. Došlić, Croat. Chem. Acta 78 (2005) 25.
4. L. Lovasz and M.D. Plummer, Matching Theory, Ann. Discr. Math. 29 (North-Holland, Amsterdam, The Netherlands, 1986).
5. F. Harary, Graph Theory (Addison-Wesley, Reading MA, 1969).
6. D.B. West, Introduction to Graph Theory (Prentice Hall, Upper Saddle River NJ, 1996).
7. S.J. Cyvin and I. Gutman, Kekulé Structures in Benzenoid Hydrocarbons, Lec. Notes in Chemistry (Springer, Heidelberg, 1988).
8. C. Rongsi, S.J. Cyvin, J. Brunvoll and D.J. Klein, Topics Curr. Chem. 153 (1990) 227.