| 关于欧拉图的一个猜想的新结果 |
| |
| 引用本文： | 王淑栋,郑惠琴.关于欧拉图的一个猜想的新结果[J].山东科技大学学报(自然科学版),1999(1). |
| |
| 作者姓名： | 王淑栋 郑惠琴 |
| |
| 作者单位： | 山东矿业学院应用数学与软件工程系 |
| |
| 摘 要： | 证明了非平面欧拉图在边连通度满足一定条件下可以表示成不超过｜Ｖ｜－２个边不重的圈的并，其中｜Ｖ｜是图的顶点数。
|
| 关 键 词： | 边连通度 连通片 顶点的度 欧拉图 |
A New Result for One Conjecture of Euler Graph |
| |
| Wang Shudong,Zheng Huiqin.A New Result for One Conjecture of Euler Graph[J].Journal of Shandong Univ of Sci and Technol: Nat Sci,1999(1). |
| |
| Authors: | Wang Shudong Zheng Huiqin |
| |
| Abstract: | In this paper,we prove that non-planar Euler graph may be expressed as the union of cycles in which less than |V|-2 edges are disjoint under the certain condictions of the edge connected degree satisfied, of which |V|is the number of all vertices of the graph. |
| |
| Keywords: | edge connected degree connected components vertex degree Euler graph |
| 本文献已被 CNKI 等数据库收录！ |
