Abstract
The minimum number of point disjoint paths which cover all the points of a graph defines a covering number denoted by ζ. The relation of ζ to some other well-known graphical invariants is discussed, and ζ is evaluated for a variety of special classes of graphs. A simple algorithm is developed for determining ζ in the case of a tree, and it is shown that this tree algorithm can be generalized to yield ζ for any connected graph. Degree conditions are also derived which yield simple upper bounds for ζ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnette, D. Trees in Polyhedral Graphs, Canad. J. Math. 18 (1966), 731–736.
Chvatal, V., On Hamilton's Ideals, J. Combinatorial Theory 12B (1972), 163–168.
Goodman, S. and Hedetniemi, S., On the Hamiltonian Completion Problem, this volume p. 262.
Harary, F., Graph Theory, Addison-Wesley, Reading, Mass. (1969).
Harary, F., Covering and Packing in Graphs, I, Ann. New York Acad. Sci., 175, (1970), 198–205.
Harary, F. and Hsiao, D., A Formal System for Information Retrieval from Files, CACM 13, (1970), 67–73.
Harary, F. and Schwenk, Evolution of the Path Number of a Graph: Covering and Packing in Graphs II, Graph Theory and Computing, (R. C. Reed, ed.) Academic Press, New York, 1972, 39–45.
Klee, V. Long Paths and Circuits on Polytopes, Chapter 17, Convex Polytopes (by B. Grünbaum), Wiley-Interscience, New York, 1967.
Knuth, D. The Art of Computer Programming, Vol. I, Addison-Wesley, Reading, Mass., 1968.
Ore, O., Arc Coverings of Graphs, Ann. Mat. Pura Appl. 55 (1961) 315–322.
Stanton, R., Cowan, D. D., and James, L. O., Some Results on Path Numbers, Proceedings of the Louisiana Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, 1970, 112–135.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin
About this paper
Cite this paper
Boesch, F.T., Chen, S., McHugh, J.A.M. (1974). On covering the points of a graph with point disjoint paths. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066442
Download citation
DOI: https://doi.org/10.1007/BFb0066442
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06854-9
Online ISBN: 978-3-540-37809-9
eBook Packages: Springer Book Archive