An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
From MaRDI portal
Publication:2676763
DOI10.1007/s00373-022-02565-0zbMath1497.05079OpenAlexW4295602343WikidataQ114229592 ScholiaQ114229592MaRDI QIDQ2676763
Publication date: 28 September 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02565-0
Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (3)
Cites Work
- Rainbow connection number and independence number of a graph
- The \(t\)-tone chromatic number of random graphs
- A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
- Colorings of plane graphs: a survey
- New results in \(t\)-tone coloring of graphs
- 2-tone colorings in graph products
- Graph Colorings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An upper bound for the 3-tone chromatic number of graphs with maximum degree 3