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)

zbMATH Keywords

perfect matchinghexagonhexagonal system

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

(34)

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

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)