Previous |  Up |  Next

Article

Title: A characterization of $K\sb{r,s}$-closed graphs (English)
Author: Híc, Pavol
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 39
Issue: 4
Year: 1989
Pages: 353-359
.
Category: math
.
MSC: 05C75
idZBL: Zbl 0757.05089
idMR: MR1094757
.
Date available: 2009-09-25T10:19:36Z
Last updated: 2012-08-01
Stable URL: http://hdl.handle.net/10338.dmlcz/129377
.
Reference: [1] CHARTRAND G., KRONK H. V.: Randomly traceable graphs.SIAM, J. Appl Math. 16, 1968,696-700. Zbl 0164.54202, MR 0234852
Reference: [2] CHARTRAND G., OELLERMAN O. R., RUIZ S.: Randomly H Graphs.Math. Slovaca 36, 1986, 129-136. MR 0849703
Reference: [3] DIRAC G. A., THOMASEN C.: Graphs in which every finite path is contained in a circuit.Math. Ann. 203, 1973, 65-75. MR 0335352
Reference: [4] HARARY F.: Graph Theory.Addison-Wesley, Reading, Mass. 1969. Zbl 0196.27202, MR 0256911
Reference: [5] ERICKSON D. B.: Arbitrarily traceable graphs and digraphs.J. Combin. Theory Ser. B., 19, 1975, 5-23. Zbl 0278.05109, MR 0398898
Reference: [6] PARSONS T. D.: Paths extendable to cycle.J. Graph Theory 2, 1978, 337-339. MR 0505821
Reference: [7] SUMNER D. P.: Randomly matchable graphs.J. Graph Theory, 3, 1979, 183-186. Zbl 0404.05053, MR 0530304
Reference: [8] TOMASTA P., TOMOVÁ E.: On H-closed graphs.Czech. Math. J. 38, 113, 1988, 404-419. Zbl 0699.05059, MR 0950294
.

Files

Files Size Format View
MathSlov_39-1989-4_1.pdf 522.6Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo