Binary code properties of perfect matching in hexagonal graph (Q5018944)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Binary code properties of perfect matching in hexagonal graph |
scientific article; zbMATH DE number 7450735
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Binary code properties of perfect matching in hexagonal graph |
scientific article; zbMATH DE number 7450735 |
Statements
27 December 2021
0 references
perfect matching
0 references
binary code
0 references
Klavzar's algorithm
0 references
hexagonal graph
0 references
0.740075945854187
0 references
0.7171915173530579
0 references
