A linear algorithm for perfect matching in hexagonal systems (Q1313858): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:45, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for perfect matching in hexagonal systems |
scientific article |
Statements
A linear algorithm for perfect matching in hexagonal systems (English)
0 references
1 March 1994
0 references
A hexagonal system is a two-connected plane graph in which each interior face is a regular hexagon. Empirical evidence shows that a benzenoid molecule corresponding to the hexagonal system exists if and only if the hexagonal system has a perfect matching (Kekulé system). The paper proposes a linear-time algorithm to find a perfect matching or to show that there is none.
0 references
Kekulé system
0 references
hexagonal system
0 references
perfect matching
0 references
linear-time algorithm
0 references
