On the (di)graphs with (directed) proper connection number two (Q5920180): Difference between revisions

@@ Property / cites work @@
+Q2829346
@@ Property / cites work: Q2829346 / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness and algorithms for rainbow connection
@@ Property / cites work: Hardness and algorithms for rainbow connection / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow connection in graphs
@@ Property / cites work: Rainbow connection in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Note on vertex and total proper connection numbers
+Normal rank
@@ Property / cites work @@
+Hamiltonian circuits determining the order of chromosomes
+Normal rank
@@ Property / cites work @@
+Proper connection with many colors
@@ Property / cites work: Proper connection with many colors / 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 @@
+Proper connection number and connected dominating sets
+Normal rank
@@ Property / cites work @@
+Characterizations of graphs having large proper connection numbers
+Normal rank
@@ Property / cites work @@
+Q5279726
@@ Property / cites work: Q5279726 / rank @@
+Normal rank
@@ Property / cites work @@
+Even dicycles
@@ Property / cites work: Even dicycles / rank @@
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank