Geodesic
Randomly $H$ graphs
Mathematica slovaca, Tome 36 (1986) no. 2, pp. 129-136
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C38, 05C75 
@article{MASLO_1986_36_2_a4,
     author = {Chartrand, Gary and Oellermann, Ortrud R. and Ruiz, Sergio},
     title = {Randomly $H$ graphs},
     journal = {Mathematica slovaca},
     pages = {129--136},
     year = {1986},
     volume = {36},
     number = {2},
     mrnumber = {849703},
     zbl = {0655.05052},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a4/}
}
TY  - JOUR
AU  - Chartrand, Gary
AU  - Oellermann, Ortrud R.
AU  - Ruiz, Sergio
TI  - Randomly $H$ graphs
JO  - Mathematica slovaca
PY  - 1986
SP  - 129
EP  - 136
VL  - 36
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a4/
LA  - en
ID  - MASLO_1986_36_2_a4
ER  - 
%0 Journal Article
%A Chartrand, Gary
%A Oellermann, Ortrud R.
%A Ruiz, Sergio
%T Randomly $H$ graphs
%J Mathematica slovaca
%D 1986
%P 129-136
%V 36
%N 2
%U http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a4/
%G en
%F MASLO_1986_36_2_a4
Chartrand, Gary; Oellermann, Ortrud R.; Ruiz, Sergio. Randomly $H$ graphs. Mathematica slovaca, Tome 36 (1986) no. 2, pp. 129-136. http://geodesic.mathdoc.fr/item/MASLO_1986_36_2_a4/

[1] BÄBLER F.: Über eine spezielle Klasse Euleгscheг Graphen. Comment. Math. Helv. 27, 1953, 81-100. | MR

[2] BEHZAD M., CHARTRAND G., LESNIAK-FOSTER L.: Gгaphs V Digraphs. Wadsworth International, Belmont, CA, 1979.

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

[4] CHARTRAND G., KRONK H. V., LICK D. R.: Randomly hamiltonian digraphs. Fund. Math. 65, 1969, 223-226. | MR | Zbl

[5] CHARTRAND G., LICK D. R.: Randomly eulerian digraphs. Czech. Math. J. 21, 1971, 424-430. | MR | Zbl

[6] CHARTRAND G., WHITE A. T.: Randomly traversable graphs. Elem. Math. 25, 1970, 101-107. | MR | Zbl

[7] DIRAC G. A., THOMASSEN C.: Graphs in which every finite path is contained in a circuit. Math. Ann. 203, 1973, 65-75. | MR | Zbl

[8] ERICKSON D. B.: Arbitrarily traceable graphs and digraphs. J. Combinatorial Theory Ser. B 19, 1975, 5-23. | MR | Zbl

[9] FINK J. F.: Randomly antitraceable digraphs. J. Graph Theory 6, 1982, 481-488. | MR | Zbl

[10] FINK J. F.: Randomly near-tranceable graphs. (Submitted for publication)

[11] HARARY F.: On arbitrarily traceable graphs and directed graphs. Scripta Math. 23, 1957, 37-41. | MR

[12] HARARY F.: Graph Theory. Addison-Wesley, Reading, MA, 1969. | MR | Zbl

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

[14] PARSONS T. D.: Paths extendable to cycle. J. Graph Theory 2, 1978, 337-339. | MR

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

[16] THOMASSEN C.: On randomly Hamiltonian graphs. Math. Ann. 200, 1973, 195-208. | MR | Zbl

[17] THOMASSEN C.: Graphs in which every path is contained in a Hamiltonian path. J. Reine Angew. Math. 268/269, 1974, 271-282. | MR