The structure character of essentially disconnected polyomino graphs

DOI10.1007/s10910-010-9754-7zbMath1207.92059OpenAlexW2035348459MaRDI QIDQ631449

C. Rongsi, Liu Zhifang

Publication date: 14 March 2011

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

Full work available at URL: https://doi.org/10.1007/s10910-010-9754-7

zbMATH Keywords

matchingnormalpolyomino graphconstructionessentially disconnectedfixed bond

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Directed graphs (digraphs), tournaments (05C20)

Related Items

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

Cites Work

• Elementary components of essentially disconnected polyomino graphs
• On some counting polynomials in chemistry
• Combinatorial properties of polyominoes
• Chessboard domination problems
• On the queen domination problem
• Perfect matchings of polyomino graphs
• King and domino polynomials for polyomino graphs