Graph labelings, embedding and NP-completeness theorems (Q3620783)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5543401
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph labelings, embedding and NP-completeness theorems |
scientific article; zbMATH DE number 5543401 |
Statements
14 April 2009
0 references
harmonious graph
0 references
elegant graph
0 references
felicitous graph
0 references
cordial graph
0 references
odd-graceful graph
0 references
polychrome graphs
0 references
strongly harmonious graph
0 references
0.8913477063179016
0 references
0.8422948122024536
0 references
0.7733743190765381
0 references
0.7592084407806396
0 references
