When each hexagon of a hexagonal system covers it
From MaRDI portal
Publication:1173981
DOI10.1016/0166-218X(91)90014-NzbMath0763.05087MaRDI QIDQ1173981
Publication date: 25 June 1992
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Related Items (34)
The anti-Kekulé number of graphs ⋮ \(k\)-cycle resonant graphs ⋮ Recognizing essentially disconnected benzenoids with fixed double bonds ⋮ Complete forcing numbers of hexagonal systems. II ⋮ Regular coronoid systems ⋮ The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials ⋮ Coronoid systems with perfect matchings ⋮ Perfect matchings of polyomino graphs ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Structural properties of resonance graphs of plane elementary bipartite graphs ⋮ 2-resonance of plane bipartite graphs and its applications to boron-nitrogen fullerenes ⋮ Planar \(k\)-cycle resonant graphs with \(k=1,2\) ⋮ Hexagonal resonance of (3,6)-fullerenes ⋮ Reducible chains of planar 1-cycle resonant graphs ⋮ A semantic tree algorithm for the generation of sextet polynomials of hexagonal systems ⋮ A complete characterization for \(k\)-resonant Klein-bottle polyhexes ⋮ Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs ⋮ \(k\)-resonant toroidal polyhexes ⋮ Generalized hexagonal systems with each hexagon being resonant ⋮ 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 ⋮ Hexagonal systems with forcing single edges ⋮ On plane bipartite graphs without fixed edges ⋮ Recognition of essentially disconnected benzenoids ⋮ Maximally resonant polygonal systems ⋮ Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems ⋮ \(k\)-resonance in toroidal polyhexes ⋮ On the global forcing number of hexagonal systems ⋮ Complete forcing numbers of hexagonal systems ⋮ The connectivity of \(Z\)-transformation graphs of perfect matchings of polyominoes ⋮ Forcing bonds of a benzenoid system ⋮ Plane elementary bipartite graphs ⋮ Hexagonal systems with fixed bonds ⋮ Complete forcing numbers of graphs
Cites Work
This page was built for publication: When each hexagon of a hexagonal system covers it
