On the hardness of determining the irregularity strength of graphs (Q2089679)
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: On the hardness of determining the irregularity strength of graphs |
scientific article; zbMATH DE number 7605948
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the hardness of determining the irregularity strength of graphs |
scientific article; zbMATH DE number 7605948 |
Statements
On the hardness of determining the irregularity strength of graphs (English)
0 references
24 October 2022
0 references
irregularity strength
0 references
distant irregularity strength
0 references
detectable colouring
0 references
graph labelling
0 references
algorithmic complexity
0 references
0 references
0.8323679566383362
0 references
0.8261840343475342
0 references
0.8254562020301819
0 references
0.8230926394462585
0 references
