The bondage number of a graphFINK, J. F; JACOBSON, M. S; KINCH, L. F et al.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 47-57, issn 0012-365X, 11 p.Article

Counting dendrograms: a surveyMURTAGH, F.Discrete applied mathematics. 1984, Vol 7, Num 2, pp 191-199, issn 0166-218XArticle

Using linear forms to determine the sets of integers realizable by (g₀,g₁,...g_n)-treesJONES, C. A.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 247-254, issn 0012-365XArticle

Generation of trees of a graph with the use of decompositionWOJCIECHOWSKI, J.Journal of the Franklin Institute. 1984, Vol 318, Num 4, pp 215-231, issn 0016-0032Article

Absence of phase transitions in rooted-tree percolationKORNILOV, E. I; PRIEZZHEV, V. B.Physics letters. A. 1984, Vol 102, Num 1-2, pp 32-33, issn 0375-9601Article

Domination alteration sets in graphsBAUER, D; HARARY, F; NIEMINEN, J et al.Discrete mathematics. 1983, Vol 47, Num 2-3, pp 153-161, issn 0012-365XArticle

Alternating automata with start formulasMOSTOWSKI, A. W.Information processing letters. 1990, Vol 35, Num 6, pp 287-290, issn 0020-0190, 4 p.Article

Embedding mesh of trees in the hypercubeEFE, K.Journal of parallel and distributed computing (Print). 1991, Vol 11, Num 3, pp 222-230, issn 0743-7315, 9 p.Article

Embedding shuffle networks in hypercubesRAVI VARADARAJAN.Journal of parallel and distributed computing (Print). 1991, Vol 11, Num 3, pp 252-256, issn 0743-7315, 5 p.Article

The cyclic wirelength of treesBEZRUKOV, S. L; SCHROEDER, U.-P.Discrete applied mathematics. 1998, Vol 87, Num 1-3, pp 275-277, issn 0166-218XArticle

Calculs distribués dans les arbres: application au test du mineur = Distributed calculus in trees: application to the test minorParies, Alain; Courcelle, B.1996, 101 p.Thesis

Automata on infinite trees with counting constraintsBEAUQUIER, D; NIWINSKI, D.Information and computation (Print). 1995, Vol 120, Num 1, pp 117-125, issn 0890-5401Article

Mean distance in a treeWINKLER, P.Discrete applied mathematics. 1990, Vol 27, Num 1-2, pp 179-185, issn 0166-218XConference Paper

Bijections between formulae and trees which are compatible with equivalence of the type ((fog)oh)∼((foh)og)NEDERPELT, R. P.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 99-105, issn 0012-365XArticle

Hypertrees and Bonferroni inequalitiesTOMESCU, I.Journal of combinatorial theory. Series B. 1986, Vol 41, Num 2, pp 209-217, issn 0095-8956Article

The minimum gap on diluted Cayley treesSTINCHCOMBE, R. B; DUXBURY, P. M; SHUKLA, P et al.Journal of physics. A, mathematical and general. 1986, Vol 19, Num 18, pp 3903-3916, issn 0305-4470Article

A note on finging minimum-cost edge-disjoint spanning treesROSKIND, J; TARJAN, R. E.Mathematics of operations research. 1985, Vol 10, Num 4, pp 701-708, issn 0364-765XArticle

Quelques extensions de la formule de trace de Selberg = Some extensions of the Selberg trace formulaAOUFI, Samia.1985, 80 pThesis

A new combinatoric estimate for cluster expansionsBATTLE, G. A. III.Communications in mathematical physics. 1984, Vol 94, Num 1, pp 133-139, issn 0010-3616Article

Separating subgraphs in k-trees: cables and caterpillarsPROSKUROWSKI, A.Discrete mathematics. 1984, Vol 49, Num 3, pp 275-285, issn 0012-365XArticle

A class of M-matrices with tree graphsJOHNSON, C. R; OLESKY, D. D; VAN DEN DRIESSCHE, P et al.SIAM journal on algebraic and discrete methods. 1983, Vol 4, Num 4, pp 476-480, issn 0196-5212Article

Enumération des arbres multicoloresBAGAEV, G. N.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1983, Num 6, pp 45-52, issn 0002-3574Article

Order distance associated with a hierarchyGUENOCHE, A.Journal of classification. 1997, Vol 14, Num 1, pp 101-115, issn 0176-4268Article

A randomized NC algorithm for the maximal tree cover problemZHI-ZHONG CHEN.Information processing letters. 1991, Vol 40, Num 5, pp 241-246, issn 0020-0190Article

Resilience of partial k-tree networks with edge and node failuresMATA-MONTERO, E.Networks (New York, NY). 1991, Vol 21, Num 3, pp 321-344, issn 0028-3045Article