Recognition of essentially disconnected benzenoids

DOI10.1007/BF02006746zbMath0770.05091OpenAlexW2352416910MaRDI 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

algorithmregular hexagonperfect matchingbenzenoidpeakvalleyconnected planar graphessentially disconnected benzenoidKekulán benzenoid

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph theory (05C99)

Related Items (6)

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

Cites Work

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

This page was built for publication: Recognition of essentially disconnected benzenoids