Geodesic
On $H$-closed graphs
Czechoslovak Mathematical Journal, Tome 38 (1988) no. 3, pp. 404-419
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1988.102236
Classification : 05C38, 05C75 
@article{10_21136_CMJ_1988_102236,
     author = {Tomasta, Pavel and Tomov\'a, Eli\v{s}ka},
     title = {On $H$-closed graphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {404--419},
     year = {1988},
     volume = {38},
     number = {3},
     doi = {10.21136/CMJ.1988.102236},
     mrnumber = {950294},
     zbl = {0699.05059},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1988.102236/}
}
TY  - JOUR
AU  - Tomasta, Pavel
AU  - Tomová, Eliška
TI  - On $H$-closed graphs
JO  - Czechoslovak Mathematical Journal
PY  - 1988
SP  - 404
EP  - 419
VL  - 38
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1988.102236/
DO  - 10.21136/CMJ.1988.102236
LA  - en
ID  - 10_21136_CMJ_1988_102236
ER  - 
%0 Journal Article
%A Tomasta, Pavel
%A Tomová, Eliška
%T On $H$-closed graphs
%J Czechoslovak Mathematical Journal
%D 1988
%P 404-419
%V 38
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1988.102236/
%R 10.21136/CMJ.1988.102236
%G en
%F 10_21136_CMJ_1988_102236
Tomasta, Pavel; Tomová, Eliška. On $H$-closed graphs. Czechoslovak Mathematical Journal, Tome 38 (1988) no. 3, pp. 404-419. doi: 10.21136/CMJ.1988.102236

[1] G. Chartrand H. V. Kronk: Randomly traceable graphs. SIAM J. Appl. Math. 16 (1968) 696-700. | DOI | MR

[2] G. Chartrand H. V. Kronk D. R. Lick: Randomly hamiltonian digraphs. Fund. Math. 65 (1969) 223-226. | DOI | MR

[3] G. Chartrand D. R. Lick: Randomly eulerian digraphs. Czech. Math. J. 21 (1971) 424-430. | MR

[4] G. Chartrand О. R. Oellermann S. Ruiz: Randomly $H$-Graphs. To appear in Math. Slovaca. | MR

[5] G. A. Dirac C. Thomassen: Graphs in which every finite path is contained in a circuit. Math. Ann. 203 (1973) 65-75. | DOI | MR

[6] D. B. Erickson: Arbitrarily traceable graphs and digraphs. J. Combinatorial Theory Ser. В 19 (1975) 5-23. | DOI | MR | Zbl

[7] F. Harary: On arbitrarily traceable graphs and directed graphs. Scripta Math. 23 (1957) 37-51. | MR

[8] О. Ore: А problem regarding the tracing of graphs. Elem. Math. 6 (1951) 49-53. | MR | Zbl

[9] T. D. Parsons: Paths extendable to cycle. J. Graph Theory 2 (1978) 337-339. | DOI | MR

[10] J. Sheehan: Fixing Subgraphs and Ulam's Conjecture. J. Combinatorial Theory 14 (1973) 125-131. | DOI | MR | Zbl

[11] J. Sheehan: Fixing sub-graphs. J. Combinatorial Theory 12 (1972) 226-244. | DOI

[12] D. P. Sumner: Randomly matchable graphs. J. Graph Theory 3 (1979) 183-186. | DOI | MR | Zbl

Cité par Sources :