From colourful to rainbow paths in graphs: colouring the vertices (Q2051888): Difference between revisions

@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Odd connection and odd vertex-connection of graphs
+Normal rank
@@ Property / cites work @@
+Graphs with conflict-free connection number two
@@ Property / cites work: Graphs with conflict-free connection number two / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Conflict-free connections of graphs
@@ Property / cites work: Conflict-free connections of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On forbidden subgraphs and rainbow connection in graphs with minimum degree 2
+Normal rank
@@ Property / cites work @@
+Rainbow connection and forbidden subgraphs
@@ Property / cites work: Rainbow connection and forbidden subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
+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 @@
+Proper connection and size of graphs
@@ Property / cites work: Proper connection and size of graphs / rank @@
+Normal rank