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

How to cite

top

Akiyama, 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
  1. CHARTRAND G., GELLER D., HEDETNIEMI S., Graphs with forbidden subgraphs, J. Comb. Theory, 10, 1971, 12-41. (1971) Zbl0223.05101MR0285427
  2. HARARY F., Graph Theory, Addison-Wesley, Reading 1969. (1969) Zbl0196.27202MR0256911
  3. HARARY F., Covering and packing in graphs I, Ann. New York Acad. Sci., 175, 1970, 198-205. (1970) Zbl0226.05119MR0263677
  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. (1972) MR0337687
  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. (1968) MR0233723
  6. NASH-WILLIAMS C.St. J. A., Decomposition of finite graphs into open chains, Canad. J. Math., 13, 1961, 157-166. (1961) Zbl0096.38003MR0122734
  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. (1970) Zbl0223.05120MR0282874
  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. (1972) Zbl0245.05117MR0342434

Citations in EuDML Documents

top
  1. D. Delamarre, B. Virot, Simulated annealing algorithm : technical improvements
  2. Xin Zhang, Guizhen Liu, The structure of plane graphs with independent crossings and its applications to coloring problems
  3. Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam P. Wojda, On odd and semi-odd linear partitions of cubic graphs
  4. Bohdan Zelinka, Cyclicity of a complete 3-equipartite graph
  5. Bohdan Zelinka, Domatic number and linear arboricity of cacti
  6. Bohdan Zelinka, Unpath number of a complete multipartite graph
  7. Pavel Tomasta, Note on linear arboricity
  8. Mirosław Truszczyński, Linear arboricity of graphs
  9. Filip Guldan, The linear arboricity of 10 -regular graphs
  10. B. Peroche, Complexité de l'arboricité linéaire d'un graphe II

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.