|
|||||
|
|
Longest paths in digraphs |
|
| Authors: | J. C. Bermond A. Germa M. C. Heydemann D. Sotteau |
| Affiliation: | (1) Laboratoire de Recherche en Informatique ERA 452, Université Paris Sud, Bat. 490, 91405 Orsay, France |
| 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. |
| Keywords: | 05 C 20 05 C 38 |
| 本文献已被 SpringerLink 等数据库收录！ | |