Digraphs with proper connection number two (Q2034401): Difference between revisions

@@ Property / cites work @@
+Proper‐walk connection number of graphs
@@ Property / cites work: Proper‐walk connection number of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A classification of locally semicomplete digraphs
@@ Property / cites work: A classification of locally semicomplete digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Directed Graphs
@@ Property / cites work: Classes of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quasi‐transitive digraphs
@@ Property / cites work: Quasi‐transitive digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the (di)graphs with (directed) proper connection number two
+Normal rank
@@ Property / cites work @@
+On the structure of strong 3-quasi-transitive digraphs
+Normal rank
@@ Property / cites work @@
+On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs
+Normal rank
@@ Property / cites work @@
+Minimum degree condition for proper connection number 2
+Normal rank
@@ Property / cites work @@
+Properly Colored Connectivity of Graphs
@@ Property / cites work: Properly Colored Connectivity of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5279726
@@ Property / cites work: Q5279726 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring graphs to produce properly colored walks
@@ Property / cites work: Coloring graphs to produce properly colored walks / rank @@
+Normal rank
@@ Property / cites work @@
+Properly colored trails, paths, and bridges
@@ Property / cites work: Properly colored trails, paths, and bridges / rank @@
+Normal rank
@@ Property / cites work @@
+On Subtournaments of a Tournament
@@ Property / cites work: On Subtournaments of a Tournament / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian paths in \(k\)-quasi-transitive digraphs
+Normal rank