| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651058 | Discrete Mathematics | 2007 | 7 Pages |
Abstract
Given a strongly connected digraph DD of order nn and a subset SS of V(D)V(D), we prove that if any two nonadjacent vertices of SS have degree sum at least 2n-12n-1, there is a directed cycle in DD that contains all the vertices of SS. This result generalizes the theorem of Meyniel on hamiltonicity.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hao Li, Evelyne Flandrin, Jinlong Shu,