| Title:
|
On $H$-closed graphs (English) |
| Author:
|
Tomasta, Pavel |
| Author:
|
Tomová, Eliška |
| Language:
|
English |
| Journal:
|
Czechoslovak Mathematical Journal |
| ISSN:
|
0011-4642 (print) |
| ISSN:
|
1572-9141 (online) |
| Volume:
|
38 |
| Issue:
|
3 |
| Year:
|
1988 |
| Pages:
|
404-419 |
| . |
| Category:
|
math |
| . |
| MSC:
|
05C38 |
| MSC:
|
05C75 |
| idZBL:
|
Zbl 0699.05059 |
| idMR:
|
MR950294 |
| DOI:
|
10.21136/CMJ.1988.102236 |
| . |
| Date available:
|
2008-06-09T15:22:05Z |
| Last updated:
|
2020-07-28 |
| Stable URL:
|
http://hdl.handle.net/10338.dmlcz/102236 |
| . |
| Reference:
|
[1] G. Chartrand H. V. Kronk: Randomly traceable graphs.SIAM J. Appl. Math. 16 (1968) 696-700. MR 0234852, 10.1137/0116056 |
| Reference:
|
[2] G. Chartrand H. V. Kronk D. R. Lick: Randomly hamiltonian digraphs.Fund. Math. 65 (1969) 223-226. MR 0246788, 10.4064/fm-65-2-223-226 |
| Reference:
|
[3] G. Chartrand D. R. Lick: Randomly eulerian digraphs.Czech. Math. J. 21 (1971) 424-430. MR 0288052 |
| Reference:
|
[4] G. Chartrand О. R. Oellermann S. Ruiz: Randomly $H$-Graphs.To appear in Math. Slovaca. MR 0849703 |
| Reference:
|
[5] G. A. Dirac C. Thomassen: Graphs in which every finite path is contained in a circuit.Math. Ann. 203 (1973) 65-75. MR 0335352, 10.1007/BF01349245 |
| Reference:
|
[6] D. B. Erickson: Arbitrarily traceable graphs and digraphs.J. Combinatorial Theory Ser. В 19 (1975) 5-23. Zbl 0278.05109, MR 0398898, 10.1016/0095-8956(75)90070-2 |
| Reference:
|
[7] F. Harary: On arbitrarily traceable graphs and directed graphs.Scripta Math. 23 (1957) 37-51. MR 0099041 |
| Reference:
|
[8] О. Ore: А problem regarding the tracing of graphs.Elem. Math. 6 (1951) 49-53. Zbl 0043.38503, MR 0041418 |
| Reference:
|
[9] T. D. Parsons: Paths extendable to cycle.J. Graph Theory 2 (1978) 337-339. MR 0505821, 10.1002/jgt.3190020408 |
| Reference:
|
[10] J. Sheehan: Fixing Subgraphs and Ulam's Conjecture.J. Combinatorial Theory 14 (1973) 125-131. Zbl 0271.05125, MR 0316317, 10.1016/0095-8956(73)90055-5 |
| Reference:
|
[11] J. Sheehan: Fixing sub-graphs.J. Combinatorial Theory 12 (1972) 226-244. 10.1016/0095-8956(72)90037-8 |
| Reference:
|
[12] D. P. Sumner: Randomly matchable graphs.J. Graph Theory 3 (1979) 183-186. Zbl 0404.05053, MR 0530304, 10.1002/jgt.3190030209 |
| . |
