Abstract
In this paper, we give a sufficient condition on the degrees of the vertices of a digraph to insure the existence of a path of given length, and we characterize the extremal graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge, Graphs and hypergraphs, North Holland, Amsterdam, 1973.
J. C. Bermond, A. Germa, M. C. Heydemann andD. Sotteau, Chemins et circuits dans les graphes orientés, Proc. Coll. Montréal, 1979.Annals of Discrete Mathematics 8 (1980), 293–309.
J. C. Bermond, On hamiltonian walks, Proc. 5th British Combinatorial Conference, Aberdeen, 1975,Congressus Numerantium 15,Utilitas Math. Publ., 41–51.
J. C. Bermond andC. Thomassen, Cycles in digraphs, a survey,J. Graph Theory,5 (1981), 1–43.
A. Ghouila-Houri, Flots et tensions dans un graphe,Ann. Scien. Ec. Norm. Sup.,81 (1964), 317–327.
M. C. Heydemann,Thesis, Université Paris-Sud.
M. C. Heydemann, On cycles and paths in digraphs,Discrete Math. 31 (1980), 217–219.
B. Jackson, Long paths and cycles in oriented graphs,J. Graph. Theory,5 (1981), 145–157,
M. Las Vergnas, Sur les arborescences dans un graphe orientéDiscrete Math. 15 (1976), 27–39.
C. Thomassen, Long cycles in digraphs,Proc. London Math. Soc. to appear.