Perfect matchings in bipartite lattice animals: lower bounds and realizability

DOI10.1007/s10910-005-6915-1zbMath1096.92057MaRDI QIDQ2503702

Tomislav Došlić

Publication date: 22 September 2006

Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10910-005-6915-1

zbMATH Keywords

lower bound; realizability; perfect matching; polyomino; lattice animal; benzenoid graph

Mathematics Subject Classification ID

05C90: Applications of graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

Related Items

Fullerene graphs with exponentially many perfect matchings, Global forcing number of benzenoid graphs

Cites Work

• Normal components, Kekulé patterns, and Clar patterns in plane bipartite graphs