De Wet, J.P. (Johan); Dunbar, Jean; Frick, Marietjie; Oellermann, Ortrud R.
(Sciendo, 2024)
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) ...