Disjoint paths spanning simple polytopal graphs
Peter Knörr · 2008
In this paper, the definition of traceability is extended to n-path-traceability, i. e. the existence of a spanning set of n disjoint paths. Subsequently, an algorithm is provided to show that for each natural number n > 1, there is a simple 3-polytopal graph with at most 44n + 46 vertices which is not n-path-traceable