Generalized hexagonal systems with each hexagon being resonant

DOI10.1016/0166-218X(92)90205-OzbMath0774.05077OpenAlexW2051313055WikidataQ127814151 ScholiaQ127814151MaRDI QIDQ1186165

Zheng Maolin, Zhang Fuji

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0166-218x(92)90205-o

zbMATH Keywords

planar graphperfect matchingshexagonal systemalternating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Benzenoid links, Elementary components of essentially disconnected polyomino graphs, Regular coronoid systems, Coronoid systems with perfect matchings, 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes, Hexagonal resonance of (3,6)-fullerenes, Reducible chains of planar 1-cycle resonant graphs, \(k\)-resonant toroidal polyhexes, Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system, On plane bipartite graphs without fixed edges, Maximally resonant polygonal systems, Plane elementary bipartite graphs

Cites Work

• Matching theory
• When each hexagon of a hexagonal system covers it