Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPHE ALEATOIRE")

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

Results 1 to 25 of 986

  • Page / 40
Export

Selection :

  • and

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

ISOLATED TREES IN A RANDOM GRAPHPALKA Z.1982; ZASTOS. MAT.; ISSN 0044-1899; POL; DA. 1982; VOL. 17; NO 2; PP. 309-316; ABS. POL; BIBL. 9 REF.Article

POISSON CONVERGENCE AND RANDOM GRAPHSBARBOUR AD.1982; MATH. PROC. CAMB. PHILOS. SOC.; ISSN 0305-0041; GBR; DA. 1982; VOL. 92; NO 2; PP. 349-359; BIBL. 6 REF.Article

THE ASYMPTOTIC BEHAVIOUR OF LOVASZ' THETA -FUNCTION FOR RANDOM GRAPHSJUHASZ F.1982; COMBINATORICA (BP., 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 2; PP. 153-155; BIBL. 3 REF.Article

DIAMETERS OF RANDOM GRAPHSKLEE V; LARMAN D.1981; CAN. J. MATH.; ISSN 0008-414X; CAN; DA. 1981; VOL. 33; NO 3; PP. 618-640; BIBL. 5 REF.Article

EPIDEMIC PROCESSES ON RANDOM GRAPHS AND THEIR THRESHOD FUNCTIONMUTAFCIEV LR.1981; SERDIKA; ISSN 0204-4110; BGR; DA. 1981; VOL. 7; NO 2; PP. 153-159; BIBL. 7 REF.Article

RANDOM GRAPHSBOLLOBAS B.1981; LECT. NOTE SER.-LONDON MATH. SOC.; ISSN 0076-0552; GBR; DA. 1981; NO 52; PP. 80-102; BIBL. 78 REF.Conference Paper

THE OUTER-DISTANCE OF NODES IN RANDOM TREESMEIR A; MOON JW.1981; AEQU. MATH.; ISSN 0001-9054; CHE; DA. 1981 PUBL. 1982; VOL. 23; NO 2-3; PP. 204-211; BIBL. 13 REF.Article

PROBABILITIES OF HOMOMORPHIC MAPPINGS FROM MULTIPLE GRAPHS.WHITE HC.1977; J. MATH. PSYCHOL.; U.S.A.; DA. 1977; VOL. 16; NO 2; PP. 121-134; BIBL. 19 REF.Article

THE ASYMPTOTIC DISTRIBUTION OF RANDOM CLUMPSHAFNER R.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 10; NO 4; PP. 335-351; ABS. ALLEM.; BIBL. 8 REF.Serial Issue

THE ROLE OF GRAPH THEORY IN SOME SIEVE ARGUMENTS OF PROBABILITY THEORYGALAMBOS J.1972; LECTURE NOTES MATH.; GERM.; DA. 1972; NO 303; PP. 81-87; BIBL. 7 REF.Serial Issue

FORMULES ASYMPTOTIQUES POUR LA PROBABILITE DE K-CONNEXITE DES GRAPHES ALEATOIRESKEL'MANS AK.1972; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1972; VOL. 17; NO 2; PP. 253-265; ABS. ANGL.; BIBL. 12 REF.Serial Issue

LARGEST RANDOM COMPONENT OF A K-CUBEAJTAI M; KOMLOS J; SZEMEREDI E et al.1982; COMBINATORICA (BP., 1981); ISSN 0209-9683; HUN; DA. 1982; VOL. 2; NO 1; PP. 1-7; BIBL. 5 REF.Article

RANDOMLY ANTITRACEABLE DIGRAPHSFINK JF.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 4; PP. 481-488; BIBL. 3 REF.Article

ON PENDANT VERTICES IN RANDOM GRAPHSPALKA Z.1981; COLLOQ. MATH.; ISSN 0010-1354; POL; DA. 1981 PUBL. 1982; VOL. 45; NO 1; PP. 159-167; BIBL. 11 REF.Article

STOCHASTIC ASPECTS OF NETWORKS.VAN SLYKE R.1975; NETWORKS; U.S.A.; DA. 1975; VOL. 5; NO 1; PP. 97-100; (SYMP. LARGE-SCALE NETWORKS. PROC.; EVANSTON, ILL.; 1974)Conference Paper

LIMIT DISTRIBUTION FOR THE EXISTENCE OF HAMILTONIAN CYCLES IN A RANDOM GRAPHKOMELOS J; SZEMEREDI E.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 55-63; BIBL. 8 REF.Article

ON THE EXISTENCE OF HAMILTONIAN CYCLES IN A CLASS OF RANDOM GRAPHSFENNER TI; FRIEZE AM.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 45; NO 2-3; PP. 301-305; BIBL. 7 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

ON COVERINGS OF RANDOM GRAPHSAJTAI M; KOMLOS J; RODL V et al.1982; COMMENTAT. MATH. UNIV. CAROL.; ISSN 0323-0171; CSK; DA. 1982; NO 23; PP. 193-198; BIBL. 2 REF.Article

ON FACTORS IN RANDOM GRAPHSSHAMIR E; UPFAL E.1981; ISR. J. MATH.; ISSN 0021-2172; ISR; DA. 1981; VOL. 39; NO 4; PP. 296-302; BIBL. 8 REF.Article

THE DIAMETER OF RANDOM GRAPHSBOLLOBAS B.1981; TRANS. AM. MATH. SOC.; ISSN 0002-9947; USA; DA. 1981; VOL. 267; NO 1; PP. 41-52; BIBL. 19 REF.Article

SUR LE MAXIMUM DE LA PROBABILITE DE CONNECTIVITELOMONOSOV MV; POLESSKIJ VP.1972; PROBL. PEREDACHI INFORM.; S.S.S.R.; DA. 1972; VOL. 8; NO 4; PP. 68-73; BIBL. 8 REF.Serial Issue

ONE-FACTOR IN RANDOM GRAPHS BASED ON VERTEX CHOICESHAMIR E; UPFAL E.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 3; PP. 281-286; BIBL. 8 REF.Article

SOME PROBLEMS IN GRAPH THEORY.ERDOS P.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 187-190; BIBL. 3 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

  • Page / 40