Perfect matchings in hexagonal systems (Q5896369): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q105944603, #quickstatements; #temporary_batch_1704714147019 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 12:05, 30 January 2024
scientific article; zbMATH DE number 3861208
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matchings in hexagonal systems |
scientific article; zbMATH DE number 3861208 |
Statements
Perfect matchings in hexagonal systems (English)
0 references
1984
0 references
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.
0 references
honeycomb system
0 references
hexagonal animal
0 references
plane graph
0 references
perfect matching
0 references
hexagonal system
0 references
