The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
From MaRDI portal
Publication:810055
DOI10.1007/BF02006061zbMath0733.05057OpenAlexW2081799004MaRDI QIDQ810055
Xiaofeng Guo, Fu Ji Zhang, Rong Si Chen
Publication date: 1988
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02006061
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items (19)
A maximum resonant set of polyomino graphs ⋮ Hexagonal systems with forcing edges ⋮ Decomposition theorem on matchable distributive lattices ⋮ Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems ⋮ On the perfect matching graph defined by a set of cycles ⋮ Second kind maximum matching graph ⋮ \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ The Clar formulas of a benzenoid system and the resonance graph ⋮ The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path. ⋮ Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs ⋮ Continuous forcing spectra of even polygonal chains ⋮ The enumeration of several classes of hexagonal systems ⋮ Structure and enumeration results of matchable Lucas cubes ⋮ The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes ⋮ Fibonacci-like cubes as \(Z\)-transformation graphs ⋮ Plane elementary bipartite graphs
Cites Work
This page was built for publication: The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
