| 3连通平面图的可去边数 |
| |
| 引用本文： | 欧见平,苏健基.3连通平面图的可去边数[J].系统科学与数学,2003,23(3):408-415. |
| |
| 作者姓名： | 欧见平 苏健基 |
| |
| 作者单位： | 1. 福建省漳州师范学院数学系,漳州,363000;厦门大学数学系,厦门,361005
2. 广西师范大学数学系,桂林,541004 |
| |
| 基金项目： | 国家自然科学基金(10171022)，漳州师范学院博士基金 |
| |
| 摘 要： | 设e是3连通图G的一边。如果G-e是某个3连通图的剖分,则称e是G的可去边。用v表示G的顶点数,本文证明了当v≥6时,3连通平面图G的可去边数的下界是v+4/2,此下界是可以达到的。
|
| 关 键 词： | 3连通平面图 可去边数 极大半轮 |
| 修稿时间： | 2000年7月10日 |
THE NUMBER OF REMOVABLE EDGES IN PLANAR 3-CONNECTED GRAPHS |
| |
| Jian Ping OU,Jian Ji SU.THE NUMBER OF REMOVABLE EDGES IN PLANAR 3-CONNECTED GRAPHS[J].Journal of Systems Science and Mathematical Sciences,2003,23(3):408-415. |
| |
| Authors: | Jian Ping OU Jian Ji SU |
| |
| Affiliation: | (1)Department of Mathematics, Zhangzhou Normal College, Fujian 363000,P.R.China, Department of Mathematics, Xiamen University, Xiamen 361005,P.R.China;(2)Department of Mathematics, Guanxi Normal University, Guilin 541004,P.R.China |
| |
| Abstract: | An edge e of a 3-connected graph G is said to be removable if G - e is a subdivision of some 3-connected graph. Let v denote the order of G. It is proved in this paper that there are at least (v+4)/2 removable edges in planar 3-connected graphs with v > 6 . The lower bound is reachable. |
| |
| Keywords: | Planar 3-connected graph removable edge maximal semiwheel |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 |
|
点击此处可从《系统科学与数学》下载全文 |
|
