Length 3 EdgeDisjoint Paths and Partial Orientation
Abstract
In 2003, it was claimed that the following problem was solvable in polynomial time: do there exist k edgedisjoint paths of length exactly 3 between vertices s and t in a given graph? The proof was flawed, and we show that this problem is NPhard even if we disallow multiple edges. We use a reduction from Partial Orientation, a problem recently shown by Pálvölgyi to be NPhard.
 Publication:

arXiv eprints
 Pub Date:
 January 2012
 arXiv:
 arXiv:1201.6578
 Bibcode:
 2012arXiv1201.6578A
 Keywords:

 Computer Science  Computational Complexity;
 Mathematics  Combinatorics;
 68Q25
 EPrint:
 5 pages, 2 figures