最小次数至少为4的超欧拉图(英文)  

Supereulerian Graphs of Minimum Degree at Least 4

作　　者：PaulA.Catlin 李相文[2] 

机构地区：[1]韦恩州立大学 [2]华中师范大学

出　　处：《数学进展》1999年第1期65-70,共6页Advances in Mathematics（China）

摘　　要：设G是2-边-连通的n阶图.假设对任何的最小边割集的每个分支的阶至少为，则或者G是一个超欧拉图或者G有5个互不相交的阶数为连通分支，当这5个分支都收缩时，G收缩为K2,3，这个结果推广了蔡小涛，P.A.Catlin,F.Jaeger和H.J.Lai等人关于超欧拉图的结果。Let G be a 2-edge-connected graph of order n. Suppose that for any bond witheach component of G-E has order at least Then either G has five disjoint connected subgraghs, all of order;, such that when all five of them are contracted, G is contracted to K2,3. Various prior conditions(due to X. T. Cai, P. A. Catlin, F.Jaeger, and H. -J. Lai) for a graph to be supereulerian, i.e., to have a spanning closed trail, follow.

关 键 词：超欧拉图 收缩 最小边割集 连通图 最小次数 

分 类 号：O157.5[理学—数学]