TWO PROBLEMS ON RANDOM TREESMOON JW.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 197-206; BIBL. 8 REF.Serial Issue

ZUR ENTSCHEIDBARKEIT DER MONADISCHEN THEORIE 2. STUFE BAUMARTIGER GRAPHEN. = SUR LA DECIDABILITE DE LA THEORIE MONADIQUE DE DEUXIEME ORDRE DES QUASI-ARBRESSEESE DG.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 768-772; ABS. RUSSE ANGL. FR.; BIBL. 24 REF.Article

RECONSTRUCTION OF A TREE FROM ITS HOMOMORPHIC IMAGES AND OTHER RELATED TRANSFORMS.KUNDU S; SAMPATHKUMAR E; BHAVE VN et al.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 117-123; BIBL. 5 REF.Article

GENERAL SOLUTION TO THE SPANNING TREE ENUMERATION PROBLEM IN MULTIGRAPH WHEELSBOSE NK; FEICK R; SUN FK et al.1973; I.E.E.E. TRANS. CIRCUIT THEORY; U.S.A.; DA. 1973; VOL. 20; NO 1; PP. 69-70; BIBL. 4 REF.Serial Issue

CYCLES IN THE COMPLEMENT OF A TREE.REID KB.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 2; PP. 163-174; BIBL. 3 REF.Article

ON STEINER MINIMAL TREES WITH RECTILINEAR DISTANCE.HWANG FK.1976; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1976; VOL. 30; NO 1; PP. 104-114; BIBL. 7 REF.Article

THE DETECTION OF MISTAKES IN THE COMPARABILITY GRAPH OF A TREE.GREEN CD.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 255-260; BIBL. 5 REF.Conference Paper

ENUMERATION OF PLANE TREES BY BRANCHES AND ENDPOINTS.RIORDAN J.1975; J. COMBINATOR. THEORY, A; U.S.A.; DA. 1975; VOL. 19; NO 2; PP. 214-222; BIBL. 7 REF.Article

CONNECTIVITY AND EDGE-DISJOINT SPANNING TREESGUSFIELD D.1983; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1983; VOL. 16; NO 2; PP. 87-89; BIBL. 7 REF.Article

ON THE COMPLEXICITY OF FINDING MULTI-CONSTRAINED SPANNING TREESCAMERINI PM; GALBIATI G; MAFFIOLI F et al.1983; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1983; VOL. 5; NO 1; PP. 39-50; BIBL. 5 REF.Conference Paper

PROOF OF HARARY'S CONJECTURE ON THE RECONSTRUCTION OF TREESLAURI J.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 79-90; BIBL. 10 REF.Article

THE AVERAGE HEIGHT OF PLANTED PLANE TREES WITH M LEAVESKEMP R.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES B; ISSN 0095-8956; USA; DA. 1983; VOL. 34; NO 2; PP. 191-208; BIBL. 13 REF.Article

TREES IN RANDOM GRAPHSERDOS P; PALKA Z.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 46; NO 2; PP. 145-150; BIBL. 5 REF.Article

CHARACTERISTICS OF CONSTRICTED JOSEPHSON TUNNELING JUNCTIONS FOR TREE DECODER USEYAMAUCHI Y; ISHIDA A.1982; TRANS. INST. ELECTRON. COMMUN. ENG. JPN, SECT. E; ISSN 0387-236X; JPN; DA. 1982; VOL. 65; NO 2; PP. 102-106; BIBL. 6 REF.Article

THE BOUNDED PATH TREE PROBLEMCAMERINI PM; GALBIATI G.1982; SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 4; PP. 474-484; BIBL. 10 REF.Conference Paper

A NOTE ON A RESULT OF R. KEMP ON R-TUPLY ROOTED PLANTED PLANE TREESPRODINGER H.1982; COMPUTING (WIEN); ISSN 0010-485X; AUT; DA. 1982; VOL. 28; NO 4; PP. 363-366; ABS. GER; BIBL. 3 REF.Article

ANTIDIRECTED SUBSTREES OF DIRECTED GRAPHSBURR SA.1982; CAN. MATH. BULL.; ISSN 0008-4395; CAN; DA. 1982; VOL. 25; NO 1; PP. 119-120; BIBL. 3 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

PARTITION NUMBERS FOR TREES AND ORDERED SETSJAMISON WALDNER RE.1981; PAC. J. MATH.; ISSN 0030-8730; USA; DA. 1981; VOL. 96; NO 1; PP. 115-140; BIBL. 18 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

A LINEAR ALGORITHM FOR CORE OF A TREEMORGAN CA; SLATER PJ.1980; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1980; VOL. 1; NO 3; PP. 247-258; BIBL. 13 REF.Article

LONG AND SHORT WALKS IN TREES.KAINEN PC.1978; LECTURE NOTES MATH.; GERM.; DA. 1978; NO 642; PP. 309-313; BIBL. 2 REF.; (THEORY APPL. GRAPHS. INT. CONF. PROC.; KALAMAZOO; 1976)Conference Paper

ON A CLASS OF POSETS AND THE CORRESPONDING COMPARABILITY GRAPHS.JUNG HA.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 125-133; BIBL. 11 REF.Article

ON PARTITIONS OF GRAPHS INTO TREES.CHUNG FRK.1978; DISCRETE MATH.; NLD; DA. 1978; VOL. 23; NO 1; PP. 23-30; BIBL. 4 REF.Article