On rainbow total-coloring of a graph (Q494442): Difference between revisions

@@ Property / full work available at URL @@
-https://doi.org/10.1016/j.dam.2015.05.012
-Normal rank
@@ Property / OpenAlex ID @@
-W872541285
@@ Property / OpenAlex ID: W872541285 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2015.05.012
+Normal rank
@@ Property / OpenAlex ID @@
+W872541285
@@ Property / OpenAlex ID: W872541285 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and Algorithms for Rainbow Connectivity
@@ Property / cites work: Hardness and Algorithms for Rainbow Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The rainbow connectivity of a graph
@@ Property / cites work: The rainbow connectivity of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
+Normal rank
@@ Property / cites work @@
+Nordhaus-Gaddum inequalities for domination in graphs
+Normal rank
@@ Property / cites work @@
+The Diameter of a Graph and its Complement
@@ Property / cites work: The Diameter of a Graph and its Complement / rank @@
+Normal rank
@@ Property / cites work @@
+The rainbow connection of a graph is (at most) reciprocal to its minimum degree
+Normal rank
@@ Property / cites work @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On the strong rainbow connection of a graph
@@ Property / cites work: On the strong rainbow connection of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+On Complementary Graphs
@@ Property / cites work: On Complementary Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms
+Normal rank