Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems

DOI10.1016/S0166-218X(97)81447-3zbMath0869.05062MaRDI QIDQ1356518

Fu Ji Zhang, Rong Si Chen

Publication date: 8 July 1997

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

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

Hamilton path; perfect matchings; hexagonal system

Mathematics Subject Classification ID

05C90: Applications of graph theory

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

92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)

05C45: Eulerian and Hamiltonian graphs

Related Items

Characterization of reducible hexagons and fast decomposition of elementary benzenoid 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., A min-max result on catacondensed benzenoid graphs, On the role of hypercubes in the resonance graphs of benzenoid graphs

Cites Work

• The connectivity of Z-transformation graphs of perfect matchings of hexagonal systems
• Z-transformation graphs of perfect matchings of hexagonal systems
• Perfect matchings in hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item