The complexity of finding certain trees in tournaments (Q5060108): Difference between revisions

@@ 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.1007/3-540-57155-8_243
+Normal rank
@@ Property / OpenAlex ID @@
+W1486093398
@@ Property / OpenAlex ID: W1486093398 / rank @@
+Normal rank
@@ Property / cites work @@
+Realization of certain generalized paths in tournaments
+Normal rank
@@ Property / cites work @@
+Parity of paths and circuits in tournaments
@@ Property / cites work: Parity of paths and circuits in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Antidirected Hamiltonian paths in tournaments
@@ Property / cites work: Antidirected Hamiltonian paths in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding generalized paths in tournaments
+Normal rank
@@ Property / cites work @@
+Antidirected Hamiltonian paths in tournaments
@@ Property / cites work: Antidirected Hamiltonian paths in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Antidirected Hamiltonian circuits in tournaments
@@ Property / cites work: Antidirected Hamiltonian circuits in tournaments / rank @@
+Normal rank
@@ Property / cites work @@
+Q3680863
@@ Property / cites work: Q3680863 / rank @@
+Normal rank