A lower bound for radio \(k\)-chromatic number of an arbitrary graph (Q5740314)
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 6606172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for radio \(k\)-chromatic number of an arbitrary graph |
scientific article; zbMATH DE number 6606172 |
Statements
26 July 2016
0 references
radio \(k\)-coloring
0 references
span
0 references
radio \(k\)-chromatic number
0 references
0.8964192867279053
0 references
0.8583855032920837
0 references
0.8492332696914673
0 references
0.8447030186653137
0 references
0.8414701819419861
0 references
