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

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

Heping Zhang, Chunhu Sun, Yaxian Zhang

Publication date: 12 August 2024

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

zbMATH Keywords

1-factorpolyomino graphresonance graphanti-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

• Title not available (Why is that?)
• Title not available (Why is that?)
• A minimax result for perfect matchings of a polyomino graph
• Hexagonal systems with forcing single edges
• Matching theory
• Perfect matchings of polyomino graphs
• Plane elementary bipartite graphs
• The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
• Z-transformation graphs of perfect matchings of hexagonal systems
• The lattice structure of the set of domino tilings of a polygon
• Hexagonal systems with forcing edges
• Spaces of domino tilings
• Forcing faces in plane bipartite graphs
• A variational principle for domino tilings
• The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
• Conway's Tiling Groups
• Perfect matchings in hexagonal systems
• Anti-forcing numbers of perfect matchings of 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)