The sum of the distances between the leaves of a tree and the ‘semi-regular’ property von Székely, L.A., Wang, Hua, Wu, Taoyang

Volltext

On subtrees of trees von Székely, L.A., Wang, Hua

Volltext

Binary trees with the largest number of subtrees von Székely, L.A., Wang, Hua

Volltext

Teasing Apart Two Trees von STEEL, M. A., SZÉKELY, L. A.

Volltext

Preoperative Predictors of Operative Morbidity and Mortality in COPD Patients Undergoing Bilateral Lung Volume Reduction Surgery von Szekely, Les A., Oelberg, David A., Wright, Cameron, Johnson, Douglas C., Wain, John, Trotman-Dickenson, Beatrice, Shepard, Jo-Anne, Kanarek, David J., Systrom, David, Ginns, Leo C.

Volltext

Extremal values for ratios of distances in trees von Barefoot, C.A., Entringer, R.C., Székely, L.A.

Volltext

A few logs suffice to build (almost) all trees: Part II von Erdös, Péter L., Steel, Michael A., Székely, LászlóA., Warnow, Tandy J.

Volltext

On the Variational Distance of Two Trees von Steel, M. A., Székely, L. A.

Volltext

Two Counterexamples in Graph Drawing von SYKORA, O, SZEKELY, L. A, VRTO, I

Volltext

A linear time algorithm for graph partition problems von Clark, L.H., Shahrokhi, F., Székely, L.A.

Volltext

An inequality for degree sequences von Székely, L.A., Clark, L.H., Entringer, R.C.

Volltext

Diameter of 4-colourable graphs von Czabarka, É., Dankelmann, P., Székely, L.A.

Volltext

A fourier inversion formula for evolutionary trees von Székely, L.A., Erdős, P.L., Steel, M.A., Penny, D.

Volltext

Counting bichromatic evolutionary trees von Erdős, Péter L., Székely, L.A.

Volltext

A new lower bound for the bipartite crossing number with applications von Shahrokhi, Farhad, Sýkora, Ondrej, Székely, László A., Vrt'o, Imrich

Volltext

On the Distribution of Lengths of Evolutionary Trees von Carter, M., Hendy, M., Penny, D., Székely, L. A., Wormald, N. C.

Volltext

Measurable chromatic number of geometric graphs and sets without some distances in euclidean space von SZEKELY, L. A

Volltext

Integral uniform flows in symmetric networks von SHAHROKHI, F, SZEKELY, L. A

Volltext

A successful concept for measuring non-planarity of graphs: the crossing number von SZEKELY, Laszlo A

Volltext

Constructing big trees from short sequences von Erdös, Péter L., Steel, Michael A., Székely, László A., Warnow, Tandy J.

Volltext