On the complexity of the disjoint paths problem - Middendorf, Matthias; Pfeiffer, Frank (Combinatorica (Budapest. 1981), 1993)
Keywords: Combinatorics; Combinatorics. Ordered structures; Exact sciences and technology; Graph theory; Mathematics; Sciences and techniques of general use; Graph path; Planar graph; NP complete problem; Counterexample; Eulerian graph; Graph circuit; Polynomial time