When each hexagon of a hexagonal system covers it

DOI10.1016/0166-218X(91)90014-NMaRDI QIDQ1173981zbMATH OpenFDO

Authors Fuji Zhang, Rongsi Chen

Publication date 25 June 1992

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

Full work available at URL https://doi.org/10.1016/0166-218X(91)90014-N

zbMATH Keywords

hexagonhexagonal systemperfect matching

Mathematics Subject Classification ID

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

Recommendations

• Generalized hexagonal systems with each hexagon being resonant
• Coronoid systems with perfect matchings
• scientific article; zbMATH DE number 2239322
• The Clar covering polynomial of hexagonal systems. III

Cites work

• scientific article; zbMATH DE number 3859146 (Why is no real title available?)
• Perfect matchings in hexagonal systems

Cited in

(36)

• Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs
• Generalized hexagonal systems with each hexagon being resonant
• Recognition of essentially disconnected benzenoids
• Hexagonal systems with fixed bonds
• \(k\)-cycle resonant graphs
• Recognizing essentially disconnected benzenoids with fixed double bonds
• Regular coronoid systems
• The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials
• Perfect matchings of polyomino graphs
• Wiener number of vertex-weighted graphs and a chemical application
• Planar \(k\)-cycle resonant graphs with \(k=1,2\)
• Reducible chains of planar 1-cycle resonant graphs
• Plane elementary bipartite graphs
• Structural properties of resonance graphs of plane elementary bipartite graphs
• The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes
• Coronoid systems with perfect matchings
• A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems
• Complete forcing numbers of hexagonal systems
• Complete forcing numbers of hexagonal systems. II
• On plane bipartite graphs without fixed edges
• \(k\)-resonance in toroidal polyhexes
• Forcing bonds of a benzenoid system
• Hexagonal resonance of (3,6)-fullerenes
• Complete forcing numbers of graphs
• 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes
• Hexagonal systems with forcing single edges
• The structural properties of \(\{(2, 3), 6 \}\)-spheres
• Forcing, anti-forcing, global forcing and complete forcing on perfect matchings of graphs -- a survey
• Maximally resonant polygonal systems
• On the global forcing number of hexagonal systems
• The anti-Kekulé number of graphs
• A complete characterization for k-resonant Klein-bottle polyhexes
• \(k\)-resonant toroidal polyhexes
• Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs
• Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal system
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems

This page was built for publication: When each hexagon of a hexagonal system covers it

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173981)