An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 (Q2676763)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 |
scientific article |
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
