Geodesic
Randomly complete $n$-partite graphs
Mathematica slovaca, Tome 39 (1989) no. 3, pp. 241-250
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C80, 05C99 
@article{MASLO_1989_39_3_a2,
     author = {Alavi, Yousef and Lick, Don R. and Tian, Songlin},
     title = {Randomly complete $n$-partite graphs},
     journal = {Mathematica slovaca},
     pages = {241--250},
     year = {1989},
     volume = {39},
     number = {3},
     mrnumber = {1016340},
     zbl = {0709.05035},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1989_39_3_a2/}
}
TY  - JOUR
AU  - Alavi, Yousef
AU  - Lick, Don R.
AU  - Tian, Songlin
TI  - Randomly complete $n$-partite graphs
JO  - Mathematica slovaca
PY  - 1989
SP  - 241
EP  - 250
VL  - 39
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/MASLO_1989_39_3_a2/
LA  - en
ID  - MASLO_1989_39_3_a2
ER  - 
%0 Journal Article
%A Alavi, Yousef
%A Lick, Don R.
%A Tian, Songlin
%T Randomly complete $n$-partite graphs
%J Mathematica slovaca
%D 1989
%P 241-250
%V 39
%N 3
%U http://geodesic.mathdoc.fr/item/MASLO_1989_39_3_a2/
%G en
%F MASLO_1989_39_3_a2
Alavi, Yousef; Lick, Don R.; Tian, Songlin. Randomly complete $n$-partite graphs. Mathematica slovaca, Tome 39 (1989) no. 3, pp. 241-250. http://geodesic.mathdoc.fr/item/MASLO_1989_39_3_a2/

[1] CHARTRAND G., LESNIAK-FOSTER L.: Graphs & Digraphs. 2nd edition, Wadsworth&Brooks, Monterey, CA, 1986.

[2] CHARTRAND G., KRONK H. V.: Randomly traceable graphs. SIAM J. Appl. Math., 16, 1968, 696-700. | MR | Zbl

[3] CARTRAND G., OELLERMANN O., RUIZ S.: Randomly H graphs. Math. Slovaca, 36, 1986, 129-136. | MR

[4] ORE O.: A problem regarding the tracing of graphs. Elem. Math., 6, 1951, 49-53. | MR | Zbl

[5] SUMNER D. P.: Randomly matchable graphs. J. Graph Theory, 3, 1979, 183-186. | MR | Zbl