Rainbow vertex-connection and forbidden subgraphs (Q1692637): Difference between revisions

@@ Property / OpenAlex ID @@
+W2964123936
@@ Property / OpenAlex ID: W2964123936 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00922
@@ Property / arXiv ID: 1602.00922 / rank @@
+Normal rank
@@ Property / cites work @@
+Dominating cliques in \(P_ 5\)-free graphs
@@ Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of determining the rainbow vertex-connection of a graph
+Normal rank
@@ Property / cites work @@
+Rainbow connection and forbidden subgraphs
@@ Property / cites work: Rainbow connection and forbidden subgraphs / 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 @@
+Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
+Normal rank
@@ Property / cites work @@
+Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
+Normal rank
@@ Property / cites work @@
+On the rainbow vertex-connection
@@ Property / cites work: On the rainbow vertex-connection / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connections of graphs: a survey
@@ Property / cites work: Rainbow connections of graphs: a survey / rank @@
+Normal rank