A linear algorithm for perfect matching in hexagonal systems
From MaRDI portal
Publication:1313858
DOI10.1016/0012-365X(93)90294-4zbMath0789.05083MaRDI QIDQ1313858
Publication date: 1 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (10)
Perfect matchings of polyomino graphs ⋮ Kekuléan benzenoids ⋮ Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs ⋮ A linear algorithm for a perfect matching in polyomino graphs ⋮ Computing large matchings in planar graphs with fixed minimum degree ⋮ A fully benzenoid system has a unique maximum cardinality resonant set ⋮ Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems ⋮ Closed formulas for the number of small paths, independent sets and matchings in fullerenes ⋮ On the global forcing number of hexagonal systems ⋮ The number of matchings of low order in hexagonal systems
Cites Work
This page was built for publication: A linear algorithm for perfect matching in hexagonal systems
