期刊文献+

极大临界k-连通图的可收缩边

Contractible Edges of Maximal Critical k-Connected Graph
下载PDF
导出
摘要 对极大临界k-连通图G的局部结构进行了讨论,证明了G中存在可收缩边e,使得G/e还是临界k-连通图. In this paper, we study the local structure of maximal critical k-connected graph. We show that every maximal critical k-connected graph contains an edge P such that G/P is critical k-connected graph.
出处 《广西师范学院学报(自然科学版)》 2016年第2期21-25,共5页 Journal of Guangxi Teachers Education University(Natural Science Edition)
基金 国家自然科学基金(11401119)
关键词 极大临界 K-连通图 可收缩边 maximal critical k-connected graph contractible edge
  • 相关文献

参考文献4

  • 1HAMIDOUNE Y O.On Critically n-connected Simple Graphs~-J].Discrete Mathematik,1971,22..333-336. 被引量:1
  • 2钟玲平,崔庆.临界k连通图中的点度数[J].应用数学学报,2012,35(5):928-934. 被引量:2
  • 3CHARTRAND G,KAUGARS A,LICK D R.Critically n -- connected graphs~J3.Proc Amer Math Soc, 1972,32 : 63- 68. 被引量:1
  • 4MADER W.Generalizations of critical connectivity of graphs~J~.Discrete Math, 1988,72:267-283. 被引量:1

二级参考文献10

  • 1Chartrand G, Kaugars A, Lick D R. Critically n-connected Graphs. Proceedings of the American Mathematical Society, 1972, 32:63-68. 被引量:1
  • 2Mader W. Eine Eigenschaft der Atome Endlicher Graphen. Archiv der Mathematik, 1971, 22:333-336. 被引量:1
  • 3Hamidoune Y O. On Critically h-Connected Simple Graphs. Discrete Mathematics, 1980, 32:257-262. 被引量:1
  • 4Maurer St, Slater P J. On k-Critical, n-connected Graphs. Discrete Mathematics, 1977, 20:255-262. 被引量:1
  • 5Mader W. Generalizations of Critical Connectivity of Graphs. Discrete Mathematics, 1988, 72: 267-283. 被引量:1
  • 6Fujita S, Kawarabayashi K. Connectivity Keeping Edges in Graphs with Large Minimum Degree.Journal of Combinatorial Theory, Series B, 2008, 98:805-811. 被引量:1
  • 7Mader W. Connectivity Keeping Paths in h;-connected Graphs. Journal of Graph Theory, 2010, 65: 61-69. 被引量:1
  • 8Mader W. Connectivity Keeping Trees in k-connected Graphs. Journal of Graph Theory, 2012, 69: 324-329. 被引量:1
  • 9Nebesky L. On Induced Subgraphs of a Block. Journal of Graph Theory, 1977, 1:69-74. 被引量:1
  • 10Mader W. Disjunkte Fragmente in Kritisch n-fach Zusammenh/ingenden Graphen. European Journal of Combinatorics, 1985, 6:353-359. 被引量:1

共引文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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