|
| 摘要: |
| 利用收缩的方法研究了超欧拉图的欧拉生成子图的边数问题,得到了结果:若 1个超欧拉图的子图H最多差 1条边有 3棵边不交的生成树,如果把H收缩后的图满足Catlin猜想,则原图也满足Catlin猜想 . |
| 关键词: 超欧拉图,欧拉生成子图,收缩,边数,边不交的生成树 |
| DOI： |
| 分类号:O157.5 G633 |
| 基金项目: |
|
| Some theorems about the number of edges of maximum spanning Elerian subgraph |
|
LI Xiao-min WANG Bin
|
| Abstract: |
| It makes use of Reduction techniques on the problem of the edge_number of Maximam SES,and the result follows: if a graph G is supereulerian,which has a subgraph H with at most one edge short of three edge_disjoint spanning trees,then the graph G satisfies |
| Key words: supereulerian graph,spanning Eulerian subgraph,reduction method,edge_number,edge_disjoint spanning tree |
