An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 (Q2676763)
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 7593910
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 |
scientific article; zbMATH DE number 7593910 |
Statements
An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 (English)
0 references
28 September 2022
0 references
\(t\)-tone \(k\)-coloring
0 references
\(t\)-tone chromatic number
0 references
\(\tau_3(G)\)
0 references
valid label
0 references
extension
0 references
0.8762174248695374
0 references
0.8627102375030518
0 references
0.8080812692642212
0 references
0.7866126894950867
0 references
