Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Arbre graphe")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 4961

  • Page / 199
Export

Selection :

  • and

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

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

ENTSCHEIDBARKEIT IN DER THEORIE BAUMARTIGER GRAPHEN. = LA DECIDABILITE DANS LA THEORIE DES QUASI-ARBRESHAVSCHILD K.1975; WISSENSCH. Z. HUMBOLDT-UNIV. BERLIN, MATH.-NATURWISSENSCH. REIHE; DTSCH.; DA. 1975; VOL. 24; NO 6; PP. 764-768; ABS. RUSSE ANGL. FR.; BIBL. 8 REF.Article

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

Constructing a binary tree efficiently from its traversalsMÄKINEN, E.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 143-147, issn 0020-7160Article

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 (g0,g1,...gn)-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

Packing a tree with a graph of the same sizeSLATER, P. J; TEO, S. K; YAP, H. P et al.Journal of graph theory. 1985, Vol 9, Num 2, pp 213-216, issn 0364-9024Article

On pseudosimilarity in treesKIRKPATRICK, D. G; KLAWE, M. M; CORNEIL, D. G et al.Journal of combinatorial theory. Series B. 1983, Vol 34, Num 3, pp 323-339, issn 0095-8956Article

Patterns in treesDERSHOWITZ, N; ZAKS, S.Discrete applied mathematics. 1989, Vol 25, Num 3, pp 241-255, issn 0166-218X, 15 p.Article

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

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

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

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

CHEMINEMENT DANS LE GRAPHE DE COMPARABILITE D'UN ARBRE PARTITION DES SOMMETS EN CYCLES.ARDITTI JC.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 111-116; BIBL. 3 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

THE CENTRALITY OF VERTICES IN TREES.ADAM A.1974; STUD. SCI. MATH. HUNGAR.; HONGR.; DA. 1974; VOL. 9; NO 3-4; PP. 285-303; BIBL. 2 REF.Article

CLIMBING CERTAIN TYPES OF ROOTED TREES. I.MEIR A; MOON JW.1976; IN: BR. COMB. CONF. J. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 461-469; BIBL. 8 REF.Conference Paper

ARBRES ET DIMENSION DES ORDRES.LECLERC B.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 14; NO 1; PP. 69-76; BIBL. 13 REF.Article

  • Page / 199