Perfect matchings in hexagonal systems

descriptionPublicationkeyboard_double_arrow_right Article 01 Mar 1984 English Publisher:Springer Science and Business Media LLCJournal:Combinatorica, volume 4, pages 89-99 (issn: 0209-9683, eissn: 1439-6912,

Copyright policy )

Authors: Horst Sachs;

doi: 10.1007/bf02579161

Perfect matchings in hexagonal systems

- Summary
- Subjects
- Metrics

Abstract

A hexagonal system (HS) is a finite connected plane graph with no cut- vertices in which every interior region is a hexagonal unit cell. The author provides a simple and fast algorithm for finding a perfect matching (PM) in an HS if it exists. He also characterizes the set of all PM's in a given HS. The results do have applications in chemistry, since an HS with a PM represents a certain molecule.

Keywords

plane graph, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), perfect matching, Polyominoes, honeycomb system, hexagonal animal, hexagonal system, Combinatorial aspects of packing and covering

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	89
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%