Johannes Köbler, Sebastian Kuhnert. The Isomorphism Problem for k-Trees is Complete for Logspace. Electronic Colloquium on Computational Complexity (ECCC), 16:53, 2009. [doi]
@article{KoblerK09-0,
title = {The Isomorphism Problem for k-Trees is Complete for Logspace},
author = {Johannes Köbler and Sebastian Kuhnert},
year = {2009},
url = {http://eccc.hpi-web.de/report/2009/053},
tags = {completeness},
researchr = {https://researchr.org/publication/KoblerK09-0},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
volume = {16},
pages = {53},
}