Necessary and sufficient conditions for circulant digraphs to be antistrong, weakly-antistrong and anti-Eulerian (Q2701392): Difference between revisions

@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Antistrong digraphs
@@ Property / cites work: Antistrong digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4367776
@@ Property / cites work: Q4367776 / rank @@
+Normal rank
@@ Property / cites work @@
+Connectivity of circulant digraphs
@@ Property / cites work: Connectivity of circulant digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+On isomorphisms of circulant digraphs of bounded degree
+Normal rank
@@ Property / cites work @@
+Antidirected Hamiltonian paths in tournaments
@@ Property / cites work: Antidirected Hamiltonian paths in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Rainbow antistrong connection in tournaments
@@ Property / cites work: Rainbow antistrong connection in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q4469426
@@ Property / cites work: Q4469426 / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphisms of circulant digraphs
@@ Property / cites work: Isomorphisms of circulant digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+The antistrong property for special digraph families
+Normal rank
@@ Property / cites work @@
+Anti-Eulerian digraphs
@@ Property / cites work: Anti-Eulerian digraphs / rank @@
+Normal rank