Elementary components of essentially disconnected polyomino graphs

DOI10.1007/S10910-009-9589-2zbMath1198.92051OpenAlexW2087501655MaRDI QIDQ848177

Xiaoling Ke, Shou Liu Wei

Publication date: 2 March 2010

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

Full work available at URL: https://doi.org/10.1007/s10910-009-9589-2

zbMATH Keywords

perfect matchingpolyomino graphessentially disconnectedelementary componentforbidden edge

Mathematics Subject Classification ID

Graph polynomials (05C31) Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (4)

A maximum resonant set of polyomino graphs ⋮ The number of Kekulé structures of polyominos on the torus ⋮ A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs ⋮ The structure character of essentially disconnected polyomino graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some counting polynomials in chemistry
• Combinatorial properties of polyominoes
• Chessboard domination problems
• On the queen domination problem
• Generalized hexagonal systems with each hexagon being resonant
• Matching theory -- a sampler: From Dénes König to the present
• Perfect matchings of polyomino graphs
• The flagged Cauchy determinant
• The statistics of dimers on a lattice
• King and domino polynomials for polyomino graphs

This page was built for publication: Elementary components of essentially disconnected polyomino graphs