Spanning eulerian subdigraphs in semicomplete digraphs (Q6046690): Difference between revisions

@@ Property / cites work @@
+Sufficient Conditions for a Digraph to be Supereulerian
+Normal rank
@@ Property / cites work @@
+Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments
+Normal rank
@@ Property / cites work @@
+Digraphs
@@ Property / cites work: Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Classes of Directed Graphs
@@ Property / cites work: Classes of Directed Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
+Normal rank
@@ Property / cites work @@
+Spanning 2-strong tournaments in 3-strong semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Q3267901
@@ Property / cites work: Q3267901 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian dicycles avoiding prescribed arcs in tournaments
+Normal rank
@@ Property / cites work @@
+Spanning local tournaments in locally semicomplete digraphs
+Normal rank
@@ Property / cites work @@
+Q3274170
@@ Property / cites work: Q3274170 / rank @@
+Normal rank
@@ Property / cites work @@
+Trail-connected tournaments
@@ Property / cites work: Trail-connected tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q4756732
@@ Property / cites work: Q4756732 / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian-connected tournaments
@@ Property / cites work: Hamiltonian-connected tournaments / rank @@
+Normal rank