Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Diks:1985:EBT,
author = "K. Diks",
title = "Embeddings of binary trees in lines",
journal = j-THEOR-COMP-SCI,
volume = "36",
number = "2--3",
pages = "319--331",
month = apr,
year = "1985",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "B0250 (Combinatorial mathematics); C1160
(Combinatorial mathematics)",
corpsource = "Inst. Inf., Warszawa Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "binary trees embedding; dilation-cost; graph theory;
n-vertex binary tree; trees (mathematics)",
pubcountry = "Netherlands A11",
treatment = "T Theoretical or Mathematical",
}