| 简化图的一个注记 |
| |
| 引用本文： | 李霄民,李登信. 简化图的一个注记[J]. 数学杂志, 2011, 31(4) |
| |
| 作者姓名： | 李霄民 李登信 |
| |
| 作者单位： | 重庆工商大学数学与统计学院,重庆,400067 |
| |
| 基金项目： | Supported by Science Foundation Chongqing Education Committee(KJ100725) |
| |
| 摘 要： | 本文研究了F(G)=3时简化图的性质.利用收缩法,给出了简化图G当F(G)=3时的两个性质.作为应用,也给出了具有至多10个3度点的3边连通的简化图的一个性质.推广了Catlin和Lai等人的一些关于F(G)≤2的结果.
|
| 关 键 词： | 超欧拉图 可折叠图 简化图 边割 |
A NOTE ON REDUCED GRAPHS |
| |
| LI Xiao-min,LI Deng-xin. A NOTE ON REDUCED GRAPHS[J]. Journal of Mathematics, 2011, 31(4) |
| |
| Authors: | LI Xiao-min LI Deng-xin |
| |
| Affiliation: | 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. |
| |
| Keywords: | super-eulerian collapsible reduced edge-cut |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《数学杂志》浏览原始摘要信息 |
|
点击此处可从《数学杂志》下载全文 |
|
