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

DOI10.1007/S10910-011-9900-XMaRDI QIDQ424181zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Elementary components of essentially disconnected polyomino graphs
• The structure character of essentially disconnected polyomino graphs
• Essential elements in connected \(k\)-polymatroids
• Lower bounds on the maximum genus of a connected graph
• On lower bounds for numbered complete graphs
• Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
• On the lower bound of the sum of the algebraic connectivity of a graph and its complement
• A note on polyomino chains with extremum general sum-connectivity index
• A lower bound for the algebraic connectivity of a graph in terms of the domination number
• scientific article; zbMATH DE number 1835112

Cites work

• scientific article; zbMATH DE number 4083659 (Why is no real title available?)
• scientific article; zbMATH DE number 15371 (Why is no real title available?)
• scientific article; zbMATH DE number 1405497 (Why is no real title available?)
• scientific article; zbMATH DE number 4183429 (Why is no real title available?)
• Chessboard domination problems
• Combinatorial properties of polyominoes
• Elementary components of essentially disconnected polyomino graphs
• Graph theory with applications
• King and domino polynomials for polyomino graphs
• Matching theory
• Matching theory -- a sampler: From Dénes König to the present
• On the queen domination problem
• Perfect matchings of generalized polyomino graphs
• Perfect matchings of polyomino graphs
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• The structure character of essentially disconnected polyomino graphs

Cited in

(4)

• A maximum resonant set of polyomino graphs
• Regular generalized polyomino graphs
• Elementary components of essentially disconnected polyomino graphs
• The structure character of essentially disconnected polyomino graphs

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

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