Previous |  Up |  Next

Article

Title: Covering and packing in graphs. III: Cyclic and acyclic invariants (English)
Author: Akiyama, Jin
Author: Exoo, Geoffrey
Author: Harary, Frank
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 30
Issue: 4
Year: 1980
Pages: 405-417
.
Category: math
.
MSC: 05C70
idZBL: Zbl 0458.05050
idMR: MR595302
.
Date available: 2009-09-25T09:10:50Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/136252
.
Reference: [1] CHARTRAND G., GELLER D., HEDETNIEMI S.: Graphs with forbidden subgraphs.J. Comb. Theory, 10, 1971, 12-41. Zbl 0223.05101, MR 0285427
Reference: [2] HARARY F.: Graph Theory.Addison-Wesley, Reading 1969. Zbl 0196.27202, MR 0256911
Reference: [3] HARARY F.: Covering and packing in graphs I.Ann. New York Acad. Sci., 175, 1970, 198-205. Zbl 0226.05119, MR 0263677
Reference: [4] HARARY F., SCHWENK A.: Evolution of the path number of graph: Covering and packing in graphs II.Graph Theory and Computing (R.C. Read, ed.), Academic Press, New York 1972, 39-45. MR 0337687
Reference: [5] LOVÁSZ L.: On covering of graphs. Theory of Graphs (P. Erdõs and G. Katona, eds.).Academic Press, New York 1968, 231-236. MR 0233723
Reference: [6] NASH-WILLIAMS C.St. J. A.: Decomposition of finite graphs into open chains.Canad. J. Math., 13, 1961, 157-166. Zbl 0096.38003, MR 0122734
Reference: [7] STANTON R., COWAN D., JAMES L.: Some results on path numbers.Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Baton Rouge, 1970, 112-135. Zbl 0223.05120, MR 0282874
Reference: [8] STANTON R., JAMES L., COWAN D.: Tripartite path numbers.Graph Theory and Computing (R. C. Read, ed.), Academic Press, New York 1972, 285-294. Zbl 0245.05117, MR 0342434
.

Files

Files Size Format View
MathSlov_30-1980-4_10.pdf 797.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo