Covering and packing in graphs. III: Cyclic and acyclic invariants
Mathematica slovaca, Tome 30 (1980) no. 4, pp. 405-417
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C70
@article{MASLO_1980_30_4_a9,
     author = {Akiyama, Jin and Exoo, Geoffrey and Harary, Frank},
     title = {Covering and packing in graphs. {III:} {Cyclic} and acyclic invariants},
     journal = {Mathematica slovaca},
     pages = {405--417},
     year = {1980},
     volume = {30},
     number = {4},
     mrnumber = {595302},
     zbl = {0458.05050},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a9/}
}
TY  - JOUR
AU  - Akiyama, Jin
AU  - Exoo, Geoffrey
AU  - Harary, Frank
TI  - Covering and packing in graphs. III: Cyclic and acyclic invariants
JO  - Mathematica slovaca
PY  - 1980
SP  - 405
EP  - 417
VL  - 30
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a9/
LA  - en
ID  - MASLO_1980_30_4_a9
ER  - 
%0 Journal Article
%A Akiyama, Jin
%A Exoo, Geoffrey
%A Harary, Frank
%T Covering and packing in graphs. III: Cyclic and acyclic invariants
%J Mathematica slovaca
%D 1980
%P 405-417
%V 30
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a9/
%G en
%F MASLO_1980_30_4_a9
Akiyama, Jin; Exoo, Geoffrey; Harary, Frank. Covering and packing in graphs. III: Cyclic and acyclic invariants. Mathematica slovaca, Tome 30 (1980) no. 4, pp. 405-417. http://geodesic.mathdoc.fr/item/MASLO_1980_30_4_a9/

[1] CHARTRAND G., GELLER D., HEDETNIEMI S.: Graphs with forbidden subgraphs. J. Comb. Theory, 10, 1971, 12-41. | MR | Zbl

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

[3] HARARY F.: Covering and packing in graphs I. Ann. New York Acad. Sci., 175, 1970, 198-205. | MR | Zbl

[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

[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

[6] NASH-WILLIAMS C.St. J. A.: Decomposition of finite graphs into open chains. Canad. J. Math., 13, 1961, 157-166. | MR | Zbl

[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. | MR | Zbl

[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. | MR | Zbl