A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index

DOI10.1007/S00373-017-1863-7zbMath1390.05070OpenAlexW2773291755MaRDI QIDQ1706430

Jun-Jie Pan, Cheng-Hsiu Tsai

Publication date: 22 March 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1863-7

zbMATH Keywords

Wiener index\(t\)-tone chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 ⋮ 2-tone coloring of cactus graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the relation between Wiener index and eccentricity of a graph

Cites Work

• The \(t\)-tone chromatic number of random graphs
• New results in \(t\)-tone coloring of graphs
• Unnamed Item

This page was built for publication: A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index