An upper bound for the 3-tone chromatic number of graphs with maximum degree 3 (Q2676763): Difference between revisions

@@ Property / cites work @@
+The \(t\)-tone chromatic number of random graphs
@@ Property / cites work: The \(t\)-tone chromatic number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5405496
@@ Property / cites work: Q5405496 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4566363
@@ Property / cites work: Q4566363 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings of plane graphs: a survey
@@ Property / cites work: Colorings of plane graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+New results in \(t\)-tone coloring of graphs
@@ Property / cites work: New results in \(t\)-tone coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4576336
@@ Property / cites work: Q4576336 / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection number and independence number of a graph
+Normal rank
@@ Property / cites work @@
+Graph Colorings
@@ Property / cites work: Graph Colorings / rank @@
+Normal rank
@@ Property / cites work @@
+-tone colorings in graph products
@@ Property / cites work: 2-tone colorings in graph products / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
+Normal rank