| 张存铨.二部定向图的最长通路和圈[J].数学研究及应用,1981,1(3):35~38 |
| 二部定向图的最长通路和圈 |
| The Longest Paths and Cycles in Bipartite Oriented Graphs |
| 投稿时间：1980-12-09 |
| DOI：10.3770/j.issn:1000-341X.1981.03.007 |
| 中文关键词: |
| 英文关键词: |
| 基金项目: |
|
| 摘要点击次数: 1975 |
| 全文下载次数: 948 |
| 中文摘要: |
| |
| 英文摘要: |
| Let D be a bipartite oriented graph in which the indegree and outdegree of each vertex are at least k. The result given in this paper is that D contains either a cycle of length at least 4k or a path of length at least 4k 1. Jackson [1] declared that: if |V(D) |≤4k,D contains a Hamiltonian cycle. Evidently, the result Of this paper implies the result given by Jackson. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
