Calculating an upper bound of the locating-chromatic number of trees (Q2285138)
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: Calculating an upper bound of the locating-chromatic number of trees |
scientific article; zbMATH DE number 7152260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating an upper bound of the locating-chromatic number of trees |
scientific article; zbMATH DE number 7152260 |
Statements
Calculating an upper bound of the locating-chromatic number of trees (English)
0 references
16 January 2020
0 references
graph algorithm
0 references
locating-chromatic number
0 references
tree
0 references
upper bound
0 references
0.8831697106361389
0 references
0.8304058313369751
0 references
0.8225158452987671
0 references
0.794247567653656
0 references
