摘要
综述了超欧拉图的生成子图边数问题,包括该问题的提出及研究发展过程,并罗列了两类公开问题:能否证明边数问题的下确界是35,若不能证明,能否找到更小的下确界?对一些著名的超欧拉图类,如具有两棵边不交的生成树的图等,能否证明其满足Catlin-猜想或35-猜想?
In this paper, eulerian subgraphs, including we survey some results on the its origin and development of were posed:Determine whether the infimum of the problem problem of number of edges in spanning research. Two classes of open problems of number of edges in spanning eulerian 3/5 conjecture for subgraphs is 3/5;if false,try for smaller one. Can we do the Catlin - conjecture or -3/5 some fitmous supereulerian graphs, for example, the graphs with 2 edge- disjoint spanning trees?
出处
《重庆工商大学学报(自然科学版)》
2006年第4期323-325,共3页
Journal of Chongqing Technology and Business University:Natural Science Edition
关键词
超欧拉图
欧拉生成子图
边数
Catlin-猜想
Supereulerian graphs
spanning eulerian subgraphs
number of edges
Catlin - conjecture