Algorithmic complexity of proper labeling problems (Q391137)
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 6244033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic complexity of proper labeling problems |
scientific article; zbMATH DE number 6244033 |
Statements
Algorithmic complexity of proper labeling problems (English)
0 references
10 January 2014
0 references
proper labeling
0 references
computational complexity
0 references
multiplicative vertex-coloring weightings
0 references
gap vertex-distinguishing edge colorings
0 references
fictional coloring
0 references
vertex-labeling by maximum
0 references
1-2-3-conjecture
0 references
multiplicative 1-2-3-conjecture
0 references
0.8061463832855225
0 references
0.7812460660934448
0 references
0.7693265676498413
0 references
0.7665438652038574
0 references
0.7642547488212585
0 references
