Thin trees in some families of distance-regular graphs

For some families of distance-regular graphs such as strongly regular graphs, Johnson graphs, cocktail-party graphs, and Hamming graphs, we give a polynomial-time construction of spanning trees of maximum degree <= 3 that are thin trees under some mild assumptions on the parameters of the graph.