摘要
设e是3连通图G的一边。如果G-e是某个3连通图的剖分,则称e是G的可去边。用v表示G的顶点数,本文证明了当v≥6时,3连通平面图G的可去边数的下界是v+4/2,此下界是可以达到的。
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.
出处
《系统科学与数学》
CSCD
北大核心
2003年第3期408-415,共8页
Journal of Systems Science and Mathematical Sciences
基金
国家自然科学基金(10171022)
漳州师范学院博士基金
关键词
3连通平面图
可去边数
极大半轮
下界
Planar 3-connected graph, removable edge, maximal semiwheel.
