Longest paths in bipartite digraphs |
| |
| Authors: | Jacqueline Ayel |
| |
| Affiliation: | Université de Savoie, Faculté des Sciences et des Techniques, BP 1104, 73011 Chambery, 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 length greater than or equal to a given value, when the digraph is bipartite and when the digraph is dipartite and oriented. These conditions are shown to be best possible. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
