| K_(2k+1)的Gallai猜想 |
| |
| 引用本文： | 蔡俊亮.K_(2k+1)的Gallai猜想[J].太原科技大学学报,1993(1). |
| |
| 作者姓名： | 蔡俊亮 |
| |
| 作者单位： | 太原重型机械学院基础部 |
| |
| 摘 要： | 本文构造性地证明了K_(2k+1)为k+1条边不重路的并图。
|
| 关 键 词： | 完全图 边不重路 并图 |
Gallai's Conjecture about K_(2k+1) |
| |
| Cai Junliang.Gallai''''s Conjecture about K_(2k+1)[J].Journal of Taiyuan University of Science and Technology,1993(1). |
| |
| Authors: | Cai Junliang |
| |
| Institution: | Cai Junliang |
| |
| Abstract: | In this paper it is proved that K_(2k+1) is k+1 edge-disjoint path union.A structural method is obtained. |
| |
| Keywords: | complete graph edge-disjoint path union graph |
| 本文献已被 CNKI 等数据库收录！ |
