On the complexity of path problems in properly colored directed graphs (Q1928492): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-011-9401-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2010949955
@@ Property / OpenAlex ID: W2010949955 / rank @@
+Normal rank
@@ Property / cites work @@
+One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete
+Normal rank
@@ Property / cites work @@
+A generalization of the Gallai-Roy theorem
@@ Property / cites work: A generalization of the Gallai-Roy theorem / rank @@
+Normal rank
@@ Property / cites work @@
+The Euclidean traveling salesman problem is NP-complete
+Normal rank
@@ Property / cites work @@
+A note on the complexity of longest path problems related to graph coloring
+Normal rank
@@ Property / cites work @@
+Q4247451
@@ Property / cites work: Q4247451 / rank @@
+Normal rank
@@ Property / cites work @@
+Variations on the Roy-Gallai theorem
@@ Property / cites work: Variations on the Roy-Gallai theorem / rank @@
+Normal rank