摘要
G是3-连通图,e是G中的一条边。若G-e是3-连通图的一个剖分,则称e是3-连通图的可去边。否则,e是G中不可去边。本文给出3-连通3-正则图中生成树外可去边的分布情况及数目。
Let G be a 3-connected graph and e an cdge of G. If, by deleting e from G the resultant graph G -e is a subdivision of a 3-connected graph, then e is called a removable edge of G. In this paper we study the problem on at least how many removable edges there are outside a spanning tree of a 3-connccted 3-regular graph.
出处
《数学研究》
CSCD
2003年第3期223-229,共7页
Journal of Mathematical Study
基金
Research supported by National Science Foundation of China
关键词
3连通3正则图
可去边
边点割断片
分布
3-Connccted 3-regular graph
Removable edge
Edge-vertex-cut fragment
