期刊文献+

3连通图中可去边的一些性质 被引量:7

SOME PROPERTIES ON REMOVABLE EDGES IN 3 CONNECTED GRAPHS
下载PDF
导出
摘要 给出3连通图中边一点割原子及分离对上可去边的分布,并给出一个应用. An edge of a 3 connected graph G is said to be removable if G e is a subdivision of a 3 connected graph.In this paper,the distribution of removable edges in the edge vertex cut atom and its separating pair for 3 connected graphs is discussed,and a application is given.
作者 苏健基
出处 《广西师范大学学报(自然科学版)》 CAS 1996年第1期12-17,共6页 Journal of Guangxi Normal University:Natural Science Edition
关键词 连通图 可去边 边-点割断片 简单图 connected graph removable edge edge vertex cut fragment.
  • 相关文献

同被引文献32

  • 1Wu Jichang,Li Xueliang,Wang Lusheng. Removable edges in a cycles of a 4-connected graph[J]. Discrete Math, 2004,287:103-111.
  • 2Xu Liqiong,Guo Xiaofeng. Removable edges in a 5-connected graph and construction method of 5-connected graphs[J].Discrete Math, 9-008,308 : 1726-1731.
  • 3Xu Liqiong,Guo Xiaofeng. Removable edges in a cycle of k-connected graphs [J]. Acta Math Sinica: English Series,2011,27(1) :1-8.
  • 4Bondy J A,Murty U S A. Graph theory with applications [M]. London: Macmillan Press, 1976.
  • 5Tutte W T. A theory of 3-connected graphs[J]. Nederl Akad Wet Proe Ser A, 1961,64 : 441-455.
  • 6Thomassen C. Kuratowskirs theorem[J]. J Graph Theory,1981,5:225-241.
  • 7Holton D,Jackson B,Saito A,et al. Removable edges in 3- connected graphs[J]. J Graph Theory, 1990, 14(4):465- 473.
  • 8Wu Jichang,Li Xueliang,Su Jianji. The number of removable edges in 4-connected graphs[J]. J Combin Theory Ser B, 2004,92: 13-40.
  • 9Wu Jichang, Li Xueliang. Removable edges in longest cycles of 4-connected graphs[J]. Graphs Combin, 2004,20 : 413-422.
  • 10苏健基,广西师范大学学报,1996年,14卷,1期,12页

引证文献7

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部