Perfect matchings in bipartite lattice animals: lower bounds and realizability

DOI10.1007/S10910-005-6915-1MaRDI QIDQ2503702zbMATH OpenOpenAlexFDO

Authors 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

benzenoid graphlattice animallower boundperfect matchingpolyominorealizability

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3987
• On a generalization of perfect b-matching
• Perfect matchings in random bipartite graphs with minimal degree at least 2
• Bipartizing matchings and Sabidussi's compatibility conjecture
• On the sets of perfect matchings for two bipartite graphs
• Perfect matchings in random subgraphs of regular bipartite graphs
• On the uniqueness of perfect matchings in bipartite graphs
• On the number of perfect matchings in a bipartite graph
• Perfect matchings in regular bipartite graphs
• A note on the number of perfect matchings of bipartite graphs

Cites work

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

Cited in

(4)

• Fullerene graphs with exponentially many perfect matchings
• Global forcing number of benzenoid graphs
• Maximal outer planar graph and perfect matching in treelike triangular lattices and treelike polyominoes
• A lower bound on the number of perfect matchings in benzenoid systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503702)