Graph Inference from a Walk for TRees of Bounded Degree 3 is NP-Complete.

Osamu Maruyama, Satoru Miyano

Browse the full MFCS paper archive.