Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
From MaRDI portal
Publication:1356518
DOI10.1016/S0166-218X(97)81447-3zbMath0869.05062MaRDI QIDQ1356518
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
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