The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes

DOI10.1016/0012-365X(95)00048-2zbMath0869.05022WikidataQ127908925 ScholiaQ127908925MaRDI QIDQ1815325

Heping Zhang

Publication date: 17 August 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

perfect matchingpolyomino\(Z\)-transformation graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Polyominoes (05B50)

Related Items

A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Decomposition theorem on matchable distributive lattices ⋮ Perfect matchings of polyomino graphs ⋮ \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ A linear algorithm for a perfect matching in polyomino graphs ⋮ The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path. ⋮ Regular generalized polyomino graphs ⋮ Continuous forcing spectra of even polygonal chains ⋮ Plane elementary bipartite graphs

Cites Work

• The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
• Matching theory
• On some counting polynomials in chemistry
• Combinatorial properties of polyominoes
• When each hexagon of a hexagonal system covers it
• Chessboard domination problems
• On the queen domination problem
• Plane elementary bipartite graphs
• Z-transformation graphs of perfect matchings of hexagonal systems
• King and domino polynomials for polyomino graphs
• Unnamed Item
• Unnamed Item