The detour order of a graph G, denoted by (G), is the order of a longest path in G. If a and b are positive integers and the vertex set of G can be partitioned into two subsets A and B such that (hAi) ≤ a and (hBi) ...