The detour order of a graph G, denoted by τ (G), is the order of a longest path in G. A partition of the vertex set of G into two sets, A and B, such that τ((A)) ≤ a and τ(〈B〉) ≤ b is called an (a, b)-partition of G. If G ...