Traceability of \(k\)-traceable oriented graphs (Q965994): Difference between revisions

@@ Property / cites work @@
+Longest path partitions in generalizations of tournaments
+Normal rank
@@ Property / cites work @@
+Every finite strongly connected digraph of stability 2 has a Hamiltonian path
+Normal rank
@@ Property / cites work @@
+Q3575434
@@ Property / cites work: Q3575434 / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets and non-augmentable paths in generalizations of tournaments
+Normal rank
@@ Property / cites work @@
+Independent sets which meet all longest paths
@@ Property / cites work: Independent sets which meet all longest paths / rank @@
+Normal rank
@@ Property / cites work @@
+Hypotraceable digraphs
@@ Property / cites work: Hypotraceable digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Stable set meeting every longest path
@@ Property / cites work: Stable set meeting every longest path / rank @@
+Normal rank
@@ Property / cites work @@
+Q3309863
@@ Property / cites work: Q3309863 / rank @@
+Normal rank
@@ Property / cites work @@
+The directed path partition conjecture
@@ Property / cites work: The directed path partition conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A traceability conjecture for oriented graphs
@@ Property / cites work: A traceability conjecture for oriented graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3105538
@@ Property / cites work: Q3105538 / rank @@
+Normal rank