摘要: |
本文研究了F(G)=3时简化图的性质.利用收缩法,给出了简化图G当F(G)=3时的两个性质.作为应用,也给出了具有至多10个3度点的3边连通的简化图的一个性质.推广了Catlin和Lai等人的一些关于F(G)≤2的结果. |
关键词: 超欧拉图 可折叠图 简化图 边割 |
DOI: |
分类号:O157.5 |
基金项目:Supported by Science Foundation Chongqing Education Committee(KJ100725) |
|
A NOTE ON REDUCED GRAPHS |
LI Xiao-min,LI Deng-xin
|
LI Xiao-min,LI Deng-xin(Mathematics & Statistics College,Chongqing Technology and Business University,Chongqing 400067,China)
|
Abstract: |
In this article, we investigate the properties of the reduced graph G with F(G) =3. By the method of the contraction, two properties on the reduced graph G with F(G) = 3 are given. Also, as an application, a property on a 3-edge-connected reduced graph with at most 10 vertices of degree 3 is given. These results extend some earlier results on F(G) ≤ 2 by Catlin and by Lai. |
Key words: super-eulerian collapsible reduced edge-cut |