Perfect matchings in bipartite lattice animals: lower bounds and realizability

DOI10.1007/s10910-005-6915-1zbMath1096.92057OpenAlexW2072097914MaRDI 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 boundrealizabilityperfect matchingpolyominolattice animalbenzenoid graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (2)

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

Cites Work

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

This page was built for publication: Perfect matchings in bipartite lattice animals: lower bounds and realizability