Perfect matchings in hexagonal systems
From MaRDI portal
Publication:5896369
DOI10.1007/BF02579161zbMath0542.05048OpenAlexW2005113023WikidataQ105944603 ScholiaQ105944603MaRDI QIDQ5896369
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579161
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of packing and covering (05B40) Polyominoes (05B50)
Related Items
Alternating cycle-free matchings ⋮ A maximum resonant set of polyomino graphs ⋮ Recognizing essentially disconnected benzenoids with fixed double bonds ⋮ Continuous forcing spectrum of regular hexagonal polyhexes ⋮ Complete forcing numbers of hexagonal systems. II ⋮ Regular coronoid systems ⋮ Hamilton paths in \(Z\)-transformation graphs of perfect matchings of hexagonal systems ⋮ Some topological properties of benzenoid \(S_ n,T_ n\)-isomers with \(n\)-radical connection ⋮ Unnamed Item ⋮ Clumsy packing of dominoes ⋮ Some novel minimax results for perfect matchings of hexagonal systems ⋮ Cut invariant \(d\) and bond orders of Kekuléan benzenoids ⋮ Resonance in elemental benzenoids ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Single coronoid systems with an anti-forcing edge ⋮ Permanents of hexagonal and armchair chains ⋮ \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs ⋮ Kekuléan benzenoids ⋮ Unnamed Item ⋮ When each hexagon of a hexagonal system covers it ⋮ Dimers belonging to three orientations on plane honeycomb lattices ⋮ Directed tree structure of the set of Kekulé patterns of generalized polyhex graphs ⋮ 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 ⋮ On graphs whose energy exceeds the number of vertices ⋮ Perfect matchings in hexagonal systems ⋮ The Even Cycle Problem for Directed Graphs ⋮ Recognition of essentially disconnected benzenoids ⋮ On the energy and spectral properties of the He matrix of hexagonal systems ⋮ Resonance structure counts in parallelogram-like benzenoids with holes ⋮ A fully benzenoid system has a unique maximum cardinality resonant set ⋮ Anti-forcing numbers of perfect matchings of graphs ⋮ Existence of perfect matchings in a plane bipartite graph ⋮ On the global forcing number of hexagonal systems ⋮ Complete forcing numbers of hexagonal systems ⋮ A theorem concerning perfect matchings in hexagonal systems ⋮ Z-transformation graphs of perfect matchings of hexagonal systems ⋮ Plane elementary bipartite graphs ⋮ Subgraph generating functions in chemistry---an example for perfect matchings on honeycomb fragments ⋮ A linear algorithm for perfect matching in hexagonal systems ⋮ Complete forcing numbers of graphs ⋮ Monotone path systems in simple regions
Cites Work
This page was built for publication: Perfect matchings in hexagonal systems
