Q5463581 (Q5463581): Difference between revisions

@@ Property / cites work @@
+Q3474664
@@ Property / cites work: Q3474664 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the Tutte polynomial on transversal matroids
+Normal rank
@@ Property / cites work @@
+Q5335885
@@ Property / cites work: Q5335885 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Complexity of Timetable and Multicommodity Flow Problems
+Normal rank
@@ Property / cites work @@
+Computing the orientable genus of projective graphs
+Normal rank
@@ Property / cites work @@
+On the theory of Pfaffian orientations. I: Perfect matchings and permanents
+Normal rank
@@ Property / cites work @@
+graphs that are irreducible for the projective plane
+Normal rank
@@ Property / cites work @@
+Projective Planarity in Linear Time
@@ Property / cites work: Projective Planarity in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Q5501836
@@ Property / cites work: Q5501836 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3684139
@@ Property / cites work: Q3684139 / rank @@
+Normal rank
@@ Property / cites work @@
+The graph genus problem is NP-complete
@@ Property / cites work: The graph genus problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding Graphs in the Plane—Algorithmic Aspects
+Normal rank