Z-transformation graphs of perfect matchings of hexagonal systems
From MaRDI portal
(Redirected from Publication:1825211)
Given a hexagonal system H, the Z-transformation graph Z(H) is the graph whose vertices are perfect matchings of H. Two vertices are adjacent in Z(H) if the symmetric difference of the corresponding matchings is a hexagon of H. The authors give some properties of this transformation graph: Z(H) is bipartite, connected and is either a path or a graph of girth 4. In addition, they characterize those hexagonal systems whose Z- transformation graphs are not 2-connected.
Recommendations
- scientific article; zbMATH DE number 1293761
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- scientific article; zbMATH DE number 4065047
- Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
- The enumeration of several classes of hexagonal systems
Cites work
- Hamilton cycles in directed Euler tour graphs
- Hamiltonicity in (0-1)-polyhedra
- scientific article; zbMATH DE number 3859146 (Why is no real title available?)
- scientific article; zbMATH DE number 3948319 (Why is no real title available?)
- scientific article; zbMATH DE number 3286806 (Why is no real title available?)
- Matroid basis graphs. I
- On certain polytopes associated with graphs
- Perfect matchings in hexagonal systems
Cited in
(62)- Fibonacci-like cubes as \(Z\)-transformation graphs
- Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
- Hexagonal systems with fixed bonds
- Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
- \(Z\)-transformation graphs of maximum matchings of plane bipartite graphs
- Z-transformation graphs of perfect matchings of plane bipartite graphs
- Plane elementary bipartite graphs
- Forcing matchings on square grids
- Structural properties of resonance graphs of plane elementary bipartite graphs
- Forbidden subgraphs of coloring graphs
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous
- On the perfect matching graph defined by a set of cycles
- Distance between \(\alpha\)-orientations of plane graphs by facial cycle reversals
- Forcing and anti-forcing edges in bipartite graphs
- The Z-transformation graph for an outerplane bipartite graph has a Hamilton path.
- Characterizations of maximum matching graphs of certain types
- The enumeration of several classes of hexagonal systems
- The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
- A min-max result on catacondensed benzenoid graphs
- Hexagonal systems with forcing edges
- Continuous forcing spectra of even polygonal chains
- Continuous forcing spectrum of regular hexagonal polyhexes
- Some novel minimax results for perfect matchings of hexagonal systems
- Determining which Fibonacci (\(p,r\))-cubes can be \(Z\)-transformation graphs
- Resonance graphs of catacondensed even ring systems
- Structure and enumeration results of matchable Lucas cubes
- Forcing faces in plane bipartite graphs
- Second kind maximum matching graph
- Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
- On plane bipartite graphs without fixed edges
- On the role of hypercubes in the resonance graphs of benzenoid graphs
- Decomposition theorem on matchable distributive lattices
- Flips on homologous orientations of surface graphs with prescribed forbidden facial cycles
- Classifying coloring graphs
- Distributive lattice structure on the set of perfect matchings of carbon nanotubes
- The relation between the \(R\)-rotation graph and the \(\overline{R}\)-rotation graph of a coronoid system
- scientific article; zbMATH DE number 4065047 (Why is no real title available?)
- scientific article; zbMATH DE number 4083658 (Why is no real title available?)
- scientific article; zbMATH DE number 1293761 (Why is no real title available?)
- Non-matchable distributive lattices
- Anti-forcing spectra of perfect matchings of graphs
- \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs: a survey
- Binary Coding of Resonance Graphs of Catacondensed Polyhexes
- Resonance Graphs and a Binary Coding of Perfect Matchings of Outerplane Bipartite Graphs
- Resonance graphs on perfect matchings of graphs on surfaces
- Outerplane bipartite graphs with isomorphic resonance graphs
- Dimers belonging to three orientations on plane honeycomb lattices
- The polyomino graphs whose resonance graphs have a 1-degree vertex
- Hexagonal systems with forcing single edges
- Components of flip graphs of domino tilings in quadriculated cylinder and torus
- Relations between polynomials based on perfect matchings and independent sets of CERS
- A decomposition structure of resonance graphs that are daisy cubes
- Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
- Components of domino tilings under flips in quadriculated tori
- Resonance graphs of plane bipartite graphs as daisy cubes
- Distance between two vertices of maximum matching graphs
- Resonance graphs that are daisy cubes: from hypercubes to independent sets via resonant sets
- The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
- A min-max result on outerplane bipartite graphs
- Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
- The Clar formulas of a benzenoid system and the resonance graph
- Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph
This page was built for publication: Z-transformation graphs of perfect matchings of hexagonal systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1825211)
