A min-max result on catacondensed benzenoid graphs

DOI10.1016/S0893-9659(01)00131-8zbMath1009.05126OpenAlexW2010300427MaRDI QIDQ1861757

Sandi Klavžar, Petra Žigert Pleteršek

Publication date: 10 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0893-9659(01)00131-8

zbMATH Keywords

hypercubeperfect matchingresonance graphbenzenoid graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (6)

Decomposition theorem on matchable distributive lattices ⋮ A min-max result on outerplane bipartite graphs ⋮ Binary Coding of Resonance Graphs of Catacondensed Polyhexes ⋮ A min-max theorem for plane bipartite graphs ⋮ The \(Z\)-transformation graph for an outerplane bipartite graph has a Hamilton path. ⋮ On the role of hypercubes in the resonance graphs of benzenoid graphs

Cites Work

• Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems
• Resonance graphs of catacondensed even ring systems are median
• Z-transformation graphs of perfect matchings of hexagonal systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A min-max result on catacondensed benzenoid graphs