2-tone coloring of cactus graphs
From MaRDI portal
Publication:6202945
DOI10.1016/j.dam.2023.12.027OpenAlexW4391019425WikidataQ129704785 ScholiaQ129704785MaRDI QIDQ6202945
Publication date: 27 February 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.027
Cites Work
- 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
- New results in \(t\)-tone coloring of graphs
- 2-tone colorings in graph products
- An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: 2-tone coloring of cactus graphs