A maximal cover of hexagonal systems
From MaRDI portal
Publication:1065827
DOI10.1007/BF02582955zbMath0577.05055OpenAlexW89062394MaRDI QIDQ1065827
Publication date: 1985
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02582955
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40)
Related Items
A maximum resonant set of polyomino graphs ⋮ A minimax result for perfect matchings of a polyomino graph ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ The Clar covering polynomial of hexagonal systems. I ⋮ The Clar formulas of a benzenoid system and the resonance graph ⋮ On the role of hypercubes in the resonance graphs of benzenoid graphs ⋮ A fully benzenoid system has a unique maximum cardinality resonant set ⋮ Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Clar structures vs Fries structures in hexagonal systems ⋮ Packing resonant hexagons in fullerenes
Cites Work
This page was built for publication: A maximal cover of hexagonal systems
