An upper bound for the path number of a graph. (English) Zbl 0403.05056


05C38 Paths and cycles
Full Text: DOI


[1] Graphs and Hypergraphs. Translated by E. Minieka, North Holland, London (1973).
[2] and , Evolution of the path number of a graph; covering and packing in graphs, II. In Graph Theory and Computing. Edited by Academic, New York (1972) 39–46.
[3] On covering of graphs. In Theory of Graphs (Proceedings of the Colloquium held at Tihany, Hungary, September, 1966). Edited by and . Academic, New York (1968) 231–236.
[4] The Theory of Graphs. American Mathematical Society, Providence, R.I. (1962).
[5] , and , Some results on path numbers. Proceedings of the Louisiana Conference on Combinatories, Graph Theory and Computing. Edited by , and . Louisiana State University, Baton Rouge (1970) 112–135.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.