An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
From MaRDI portal
Publication:2676763
Recommendations
Cites work
- 2-tone coloring of graphs with maximum degree 4
- 2-tone colorings in graph products
- t-tone colorings of graphs
- A lower bound for the t-tone chromatic number of a graph in terms of Wiener index
- Colorings of plane graphs: a survey
- Graph Colorings
- scientific article; zbMATH DE number 6277727 (Why is no real title available?)
- New results in \(t\)-tone coloring of graphs
- Rainbow connection number and independence number of a graph
- The \(t\)-tone chromatic number of random graphs
Cited in
(9)- Maximum chromatic polynomial of 3-chromatic blocks
- New results in \(t\)-tone coloring of graphs
- A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
- scientific article; zbMATH DE number 721725 (Why is no real title available?)
- 2-tone coloring of graphs with maximum degree 4
- 2-tone coloring of chordal and outerplanar graphs
- scientific article; zbMATH DE number 7731183 (Why is no real title available?)
- 2-tone coloring of cactus graphs
- The t-tone coloring of some finite planar lattices
This page was built for publication: An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676763)