Covering and packing in graphs. III: Cyclic and acyclic invariants
Jin Akiyama; Geoffrey Exoo; Frank Harary
Mathematica Slovaca (1980)
- Volume: 30, Issue: 4, page 405-417
- ISSN: 0232-0525
Access Full Article
top
How to cite
topAkiyama, Jin, Exoo, Geoffrey, and Harary, Frank. "Covering and packing in graphs. III: Cyclic and acyclic invariants." Mathematica Slovaca 30.4 (1980): 405-417. <http://eudml.org/doc/34095>.
@article{Akiyama1980,
author = {Akiyama, Jin, Exoo, Geoffrey, Harary, Frank},
journal = {Mathematica Slovaca},
keywords = {point linear arboricity; path number; point anarboricity; cyclicity; complete graphs; complete bipartite graphs; line graphs},
language = {eng},
number = {4},
pages = {405-417},
publisher = {Mathematical Institute of the Slovak Academy of Sciences},
title = {Covering and packing in graphs. III: Cyclic and acyclic invariants},
url = {http://eudml.org/doc/34095},
volume = {30},
year = {1980},
}
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
PB - Mathematical Institute of the Slovak Academy of Sciences
VL - 30
IS - 4
SP - 405
EP - 417
LA - eng
KW - point linear arboricity; path number; point anarboricity; cyclicity; complete graphs; complete bipartite graphs; line graphs
UR - http://eudml.org/doc/34095
ER -
References
top- CHARTRAND G., GELLER D., HEDETNIEMI S., Graphs with forbidden subgraphs, J. Comb. Theory, 10, 1971, 12-41. (1971) Zbl0223.05101MR0285427
- HARARY F., Graph Theory, Addison-Wesley, Reading 1969. (1969) Zbl0196.27202MR0256911
- HARARY F., Covering and packing in graphs I, Ann. New York Acad. Sci., 175, 1970, 198-205. (1970) Zbl0226.05119MR0263677
- 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. (1972) MR0337687
- LOVÁSZ L., On covering of graphs. Theory of Graphs (P. Erdõs and G. Katona, eds.), Academic Press, New York 1968, 231-236. (1968) MR0233723
- NASH-WILLIAMS C.St. J. A., Decomposition of finite graphs into open chains, Canad. J. Math., 13, 1961, 157-166. (1961) Zbl0096.38003MR0122734
- STANTON R., COWAN D., JAMES L., Some results on path numbers, Proc. Louisiana Conf. Combinatorics, Graph Theory and Computing, Baton Rouge, 1970, 112-135. (1970) Zbl0223.05120MR0282874
- STANTON R., JAMES L., COWAN D., Tripartite path numbers, Graph Theory and Computing (R. C. Read, ed.), Academic Press, New York 1972, 285-294. (1972) Zbl0245.05117MR0342434
Citations in EuDML Documents
top- D. Delamarre, B. Virot, Simulated annealing algorithm : technical improvements
- Xin Zhang, Guizhen Liu, The structure of plane graphs with independent crossings and its applications to coloring problems
- Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam P. Wojda, On odd and semi-odd linear partitions of cubic graphs
- Bohdan Zelinka, Cyclicity of a complete 3-equipartite graph
- Bohdan Zelinka, Domatic number and linear arboricity of cacti
- Bohdan Zelinka, Unpath number of a complete multipartite graph
- Pavel Tomasta, Note on linear arboricity
- Mirosław Truszczyński, Linear arboricity of graphs
- Filip Guldan, The linear arboricity of -regular graphs
- B. Peroche, Complexité de l'arboricité linéaire d'un graphe II
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.