Elementary components of essentially disconnected polyomino graphs
From MaRDI portal
Recommendations
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- The structure character of essentially disconnected polyomino graphs
- scientific article; zbMATH DE number 168175
- The structure feature of essentially disconnected benzenoid systems
- Perfect matchings of polyomino graphs
Cites work
- Chessboard domination problems
- Combinatorial properties of polyominoes
- Generalized hexagonal systems with each hexagon being resonant
- Graph theory with applications
- scientific article; zbMATH DE number 4083659 (Why is no real title available?)
- scientific article; zbMATH DE number 168175 (Why is no real title available?)
- King and domino polynomials for polyomino graphs
- Matching theory -- a sampler: From Dénes König to the present
- On some counting polynomials in chemistry
- On the queen domination problem
- Perfect matchings of polyomino graphs
- The flagged Cauchy determinant
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
Cited in
(5)- The number of Kekulé structures of polyominos on the torus
- A maximum resonant set of polyomino graphs
- A lower bound on the number of elementary components of essentially disconnected generalized polyomino graphs
- The structure character of essentially disconnected polyomino graphs
- The polyomino graphs whose resonance graphs have a 1-degree vertex
This page was built for publication: Elementary components of essentially disconnected polyomino graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848177)