The polyomino graphs whose resonance graphs have a 1-degree vertex

DOI10.1016/j.amc.2024.128704zbMATH Open1545.05191MaRDI QIDQ6585545FDOQ6585545

Authors Chunhu Sun, Yaxian Zhang, Heping Zhang

Publication date 12 August 2024

Published in Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

polyomino graphresonance graph1-factoranti-forcing edgeforcing edge

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Polyominoes (05B50)

Recommendations

• On maximal resonance of polyomino graphs
• A maximum resonant set of polyomino graphs
• Forcing and anti-forcing polynomials of a type of polyomino graphs
• The maximum forcing number of a polyomino
• Elementary components of essentially disconnected polyomino graphs

Cites work

• A minimax result for perfect matchings of a polyomino graph
• A variational principle for domino tilings
• Anti-forcing numbers of perfect matchings of graphs
• Conway's Tiling Groups
• Forcing faces in plane bipartite graphs
• Graph theory with applications
• Hexagonal systems with forcing edges
• Hexagonal systems with forcing single edges
• Matching theory
• Perfect matchings in hexagonal systems
• Perfect matchings of polyomino graphs
• Plane elementary bipartite graphs
• Spaces of domino tilings
• The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
• The lattice structure of the set of domino tilings of a polygon
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Z-transformation graphs of perfect matchings of hexagonal systems
• \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs: a survey

This page was built for publication: The polyomino graphs whose resonance graphs have a 1-degree vertex

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