Note on directed proper connection number of a random graph (Q2279590): Difference between revisions

@@ Property / DOI @@
-.1016/j.amc.2019.05.028
@@ Property / DOI: 10.1016/j.amc.2019.05.028 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.amc.2019.05.028
+Normal rank
@@ Property / OpenAlex ID @@
+W2947136787
@@ Property / OpenAlex ID: W2947136787 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2829346
@@ Property / cites work: Q2829346 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4836076
@@ Property / cites work: Q4836076 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3786318
@@ Property / cites work: Q3786318 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits determining the order of chromosomes
+Normal rank
@@ Property / cites work @@
+On the (di)graphs with (directed) proper connection number two
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+On the strength of connectedness of a random graph
+Normal rank
@@ Property / cites work @@
+Random Graphs
@@ Property / cites work: Random Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection number of random graphs
@@ Property / cites work: Proper connection number of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Strength of Connectivity of a Random Graph
@@ Property / cites work: The Strength of Connectivity of a Random Graph / rank @@
+Normal rank
@@ Property / cites work @@
+The transitive closure of a random digraph
@@ Property / cites work: The transitive closure of a random digraph / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow vertex connection of digraphs
@@ Property / cites work: Rainbow vertex connection of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Total rainbow connection of digraphs
@@ Property / cites work: Total rainbow connection of digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of graphs having large proper connection numbers
+Normal rank
@@ Property / cites work @@
+Properly Colored Connectivity of Graphs
@@ Property / cites work: Properly Colored Connectivity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+General percolation and random graphs
@@ Property / cites work: General percolation and random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5279726
@@ Property / cites work: Q5279726 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5646917
@@ Property / cites work: Q5646917 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Probability of Connectedness of a Random Graph $\mathcal{G}_m (t)$
+Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2019.05.028
@@ Property / DOI: 10.1016/J.AMC.2019.05.028 / rank @@
+Normal rank