A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs

DOI10.1007/S10910-011-9900-XzbMath1238.92070OpenAlexW2075546798MaRDI QIDQ424181

Xiaoling Ke

Publication date: 31 May 2012

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

Full work available at URL: https://doi.org/10.1007/s10910-011-9900-x

zbMATH Keywords

lower boundperfect matchingessentially disconnected

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 (1)

A maximum resonant set of polyomino graphs

Cites Work

• The structure character of essentially disconnected polyomino graphs
• Elementary components of essentially disconnected polyomino graphs
• Matching theory
• Combinatorial properties of polyominoes
• Chessboard domination problems
• On the queen domination problem
• Matching theory -- a sampler: From Dénes König to the present
• Perfect matchings of polyomino graphs
• Perfect matchings of generalized polyomino graphs
• The statistics of dimers on a lattice
• King and domino polynomials for polyomino graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs