New results in \(t\)-tone coloring of graphs

zbMath1266.05009arXiv1108.4751MaRDI QIDQ1953497

Jae-Hoon Kim, Daniel W. Cranston, William B. Kinnersley

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.4751

zbMATH Keywords

\(t\)-tone chromatic number

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 ⋮ 2-tone coloring of cactus graphs ⋮ A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index ⋮ Unnamed Item ⋮ Unnamed Item ⋮ 2-tone colorings in graph products ⋮ The \(t\)-tone chromatic number of random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The \(t\)-tone chromatic number of random graphs
• Set colourings of graphs
• Labelling Graphs with a Condition at Distance 2
• Multichromatic numbers, star chromatic numbers and Kneser graphs
• Coloring Powers of Chordal Graphs

This page was built for publication: New results in \(t\)-tone coloring of graphs