Identifying $X$-trees with few characters.

Bordewich, Magnus, Semple, Charles, and Steel, Mike. "Identifying -trees with few characters.." The Electronic Journal of Combinatorics [electronic only] 13.1 (2006): Research paper R83, 11 p.-Research paper R83, 11 p.. <http://eudml.org/doc/126960>.

@article{Bordewich2006,
author = {Bordewich, Magnus, Semple, Charles, Steel, Mike},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper R83, 11 p.-Research paper R83, 11 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Identifying -trees with few characters.},
url = {http://eudml.org/doc/126960},
volume = {13},
year = {2006},
}

TY - JOUR
AU - Bordewich, Magnus
AU - Semple, Charles
AU - Steel, Mike
TI - Identifying -trees with few characters.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2006
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 13
IS - 1
SP - Research paper R83, 11 p.
EP - Research paper R83, 11 p.
LA - eng
UR - http://eudml.org/doc/126960
ER -