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

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

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

[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

[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

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

[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 0282874 | Zbl 0223.05120

[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 0342434 | Zbl 0245.05117