重庆工商大学学报（自然科学版）2006，Vol.23Issue(4)：323-325,3.
超欧拉图生成子图边数问题的综述
On the problem of number of edges in spanning eulerian subgraphs
李霄民 1王斌 2雷澜2
作者信息
- 1. 西南大学,数学与财经学院,重庆,400715
- 2. 重庆工商大学,理学院,重庆,400067
- 折叠
摘要
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 3/5;if false,try for smaller one.Can we do the Catlin-conjecture or 3/5-conjecture for some famous supereulerian graphs,for example,the graphs with 2 edge-disjoint spanning trees?关键词
超欧拉图/欧拉生成子图/边数/Catlin-猜Key words
Supereulerian graphs/spanning eulerian subgraphs/number of edges/Catlin-conjecture分类
数理科学引用本文复制引用
李霄民,王斌,雷澜..超欧拉图生成子图边数问题的综述[J].重庆工商大学学报（自然科学版）,2006,23(4):323-325,3.
