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)

Cites Work

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

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)