THE GENERALISATION OF TUTTE'S RESULT FOR CHROMATIC TREES, BY LAGRANGIAN METHODSJACKSON DM; GOULDEN IP.1981; CAN J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 1; PP. 12-19; BIBL. 6 REF.Article

THE AVERAGE HEIGHT OF R-TUPLY ROOTED PLANTED PLANE TREESKEMP R.1980; COMPUTING; ISSN 0010-485X; AUT; DA. 1980; VOL. 25; NO 3; PP. 209-232; ABS. GER; BIBL. 14 REF.Article

SPANNING TREES IN POLYTOPAL GRAPHSMALKEVITCH J.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 362-367; BIBL. 14 REF.Conference Paper

UEBER EINE EIGENSCHAFT LOKALFINITER, UNENDLICHER BAEUME = SUR UN ARBRE INFINI, LOCALEMENT FINI ARBITRAIREANDREAE T.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 2; PP. 202-215; ABS. ENG; BIBL. 9 REF.Article

GENERATING T-ARY TREES LEXICOGRAPHICALLYRUSKEY F.1978; S.I.A.M. J. COMPUTG; USA; DA. 1978; VOL. 7; NO 4; PP. 424-439; BIBL. 7 REF.Article

A METHOD TO GENERATE GRACEFUL TREESGYARFAS A; LEHEL J.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 207-209; ABS. FRE; BIBL. 3 REF.Conference Paper

PROGRAM NETS AND ALMOST TREES.CULIK K.1976; IN: GRAPHS HYPERGRAPHS BLOCK SYST. SYMP. COMB. ANAL. PROC.; ZIELONA GORA; 1976; ZIELONA GORA; DA. 1976; PP. 37-51; BIBL. 8 REF.Conference Paper

ON CENTRAL TREES OF A GRAPHSHINODA S; KAWAMOTO T.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 137-151; BIBL. 11 REF.Conference Paper

ANOTHER CLASS OF GRACEFUL TREESKOH KM; ROGERS DG; TAN T et al.1981; J. AUSTR. MATH. SOC., A; AUS; DA. 1981; VOL. 31; NO 2; PP. 226-235; BIBL. 10 REF.Article

ARBORESCENT STRUCTURES. II: INTERPRETABILITY IN THE THEORY OF TREESSCHMERL JH.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 266; NO 2; PP. 629-643; BIBL. 10 REF.Article

ENUMERATIONS OF ORDERED TREESDERSHOWITZ N; ZAKS S.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 1; PP. 9-28; BIBL. 7 REF.Article

ESTABLISHING THE MINIMALITY OF PHYLOGENETIC TREES FROM PROTEIN SEQUENCESHENDY MD.1980; LECTURE NOTES MATH.; ISSN 0075-8434; DEU; DA. 1980; NO 829; PP. 165-171; BIBL. 5 REF.Conference Paper

SLIM TREESEVANS E.1980; J. AUST. MATH. SOC., SER. A, PURE MATH. STAT.; ISSN 0334-3316; AUS; DA. 1980; VOL. 30; PART. 2; PP. 201-214; BIBL. 4 REF.Article

CLIMBING CERTAIN TYPES OF ROOTED TREES. II.MEIR A; MOON JW.1978; ACTA MATH. ACAD. SCI. HUNGAR.; HONGR.; DA. 1978; VOL. 31; NO 1-2; PP. 43-54; BIBL. 10 REF.Article

DISTANCE MATRIX POLYNOMIALS OF TREES.GRAHAM RL; LOVASZ L.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 186-190; BIBL. 7 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

A CONSTRUCTIVE CHARACTERIZATION OF TREES WITH AT LEAST K DISJOINT MAXIMUM MATCHINGSSLATER PJ.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 326-338; BIBL. 3 REF.Article

A LINEAR ALGORITHM FOR DISJOINT MATCHINGS IN TREES.COCKAYNE EJ; HARTNELL BL; HEDETNIEMI ST et al.1978; DISCRETE MATH.; NETHERL.; DA. 1978; VOL. 21; NO 2; PP. 129-136; BIBL. 9 REF.Article

CODE FOR MULTI-ROOTED PLANE TREES.HAYASHI K; AZUMA S.1977; TRU MATH.; JAP.; DA. 1977; VOL. 13; NO 1; PP. 75-87; BIBL. 6 REF.Article

THE CHARTRAND-SCHUSTER CONJECTURE. GRAPHS WITH UNIQUE DISTANCE TREES ARE REGULAR.KUNDU S.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 22; NO 3; PP. 233-245; BIBL. 5 REF.Article

A NOTE ON THE ARBORICITY OF THE COMPLEMENT OF A TREE.AKIYAMA H; HAMADA T.1977; TRU MATH.; JAP.; DA. 1977; VOL. 13; NO 1; PP. 55-57; BIBL. 3 REF.Article

EDGE DISJOINT REALIZATIONS OF TWO FOREST-REALIZABLE SEQUENCES.KOREN M.1976; S.I.A.M.J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 30; NO 4; PP. 625-629; BIBL. 4 REF.Article

INPLEMENTING DICTIONARIES USING BINARY TREES OF VERY SMALL HEIGHT.MAURER HA; OTTMANN T; SIX HW et al.1976; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1976; VOL. 5; NO 1; PP. 11-14; BIBL. 8 REF.Article

GENERALIZED 1-FACTORIZATION OF TREESCARO Y; SCHOENHEIM J.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 3; PP. 319-321; BIBL. 8 REF.Article

CONSTANT TIME GENERATION OF ROOTED TREESBEYER T; HEDETNIEMI SM.1980; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1980; VOL. 9; NO 4; PP. 706-712; BIBL. 12 REF.Article

HIGHER ORDER ANALYSIS OF RANDOM 1-2 BROTHER TREESOTTMANN T; STUCKY W.1980; BIT (NORD. TIDSKR. INF-BEHANDL.); ISSN 0006-3835; SWE; DA. 1980; VOL. 20; NO 3; PP. 302-314; BIBL. 10 REF.Article