Loading...
Please wait, while we are loading the content...
Similar Documents
A Note on Directed 5-Cycles in Digraphs *
| Content Provider | Semantic Scholar |
|---|---|
| Author | Liang, Hao Xu, Junming |
| Copyright Year | 2012 |
| Abstract | In this note, it is proved that if 0.24817 , then any digraph on n vertices with minimum outdegree at least n contains a directed cycle of length at most 5. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://file.scirp.org/pdf/AM20120700013_11769404.pdf |
| Alternate Webpage(s) | http://staff.ustc.edu.cn/~xujm/201211.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Cycle (graph theory) Degree (graph theory) Directed graph |
| Content Type | Text |
| Resource Type | Article |