| 超欧拉图生成子图边数问题的综述 |
| |
| 引用本文： | 李霄民,王斌,雷澜.超欧拉图生成子图边数问题的综述[J].重庆工商大学学报(自然科学版),2006,23(4):323-325. |
| |
| 作者姓名： | 李霄民 王斌 雷澜 |
| |
| 作者单位： | 1. 西南大学,数学与财经学院,重庆,400715;重庆工商大学,理学院,重庆,400067
2. 重庆工商大学,理学院,重庆,400067 |
| |
| 摘 要： | 综述了超欧拉图的生成子图边数问题,包括该问题的提出及研究发展过程,并罗列了两类公开问题:能否证明边数问题的下确界是35,若不能证明,能否找到更小的下确界?对一些著名的超欧拉图类,如具有两棵边不交的生成树的图等,能否证明其满足Catlin-猜想或35-猜想?
|
| 关 键 词： | 超欧拉图 欧拉生成子图 边数 Catlin-猜想 |
| 文章编号： | 1672-058X（2006）04-0323-03 |
| 收稿时间： | 2006-03-14 |
| 修稿时间： | 2006-03-142006-05-12 |
On the problem of number of edges in spanning eulerian subgraphs |
| |
| LI Xiao-min,WANG Bin,LEI Lan.On the problem of number of edges in spanning eulerian subgraphs[J].Journal of Chongqing Technology and Business University:Natural Science Edition,2006,23(4):323-325. |
| |
| Authors: | LI Xiao-min WANG Bin LEI Lan |
| |
| Institution: | 1. School of Mathematics and Finance Southwest University, Chongqing 400715 ; 2. The Faculty of Chongqing Technology and Business University, Chongqing 400067, China |
| |
| Abstract: | In this paper,we survey some results on the problem of number of edges in spanning eulerian subgraphs,including its origin and development of research.Two classes of open problems were posed:Determine whether the infimum of the problem of number of edges in spanning eulerian subgraphs is 35;if false,try for smaller one.Can we do the Catlin-conjecture or 35-conjecture for some famous supereulerian graphs,for example,the graphs with 2 edge-disjoint spanning trees? |
| |
| Keywords: | Supereulerian graphs spanning eulerian subgraphs number of edges Catlin-conjecture |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆工商大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆工商大学学报(自然科学版)》下载免费的PDF全文 |
|
