Recognition of essentially disconnected benzenoids

DOI10.1007/BF02006746zbMath0770.05091MaRDI QIDQ1210271

Sven J. Cyvin, Björg N. Cyvin, Rong Si Chen

Publication date: 24 May 1993

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02006746

zbMATH Keywords

algorithm; regular hexagon; perfect matching; benzenoid; peak; valley; connected planar graph; essentially disconnected benzenoid; Kekulán benzenoid

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

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

05C75: Structural characterization of families of graphs

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

05C99: Graph theory

Related Items

Dimers belonging to three orientations on plane honeycomb lattices, Hexagonal systems with fixed bonds, Recognizing essentially disconnected benzenoids with fixed double bonds, Planar \(k\)-cycle resonant graphs with \(k=1,2\), Reducible chains of planar 1-cycle resonant graphs, Coronoid systems with perfect matchings

Cites Work

• When each hexagon of a hexagonal system covers it
• Perfect matchings in hexagonal systems
• Unnamed Item