期刊文献+

3-正则图的环边连通性和环连通性之间的关系 被引量:1

The relation between cyclic edge-connectivity and cyclic connectivity of 3-regular connected graphs
原文传递
导出
摘要 研究了一般3-正则连通图G的环边连通性和环连通性之间的关系,证明了G的环边连通度等于其环连通度。讨论了G的环连通度与环点连通度之间的关系,指出当G的顶点个数不少于其环连通度的6倍时,其环连通度等于其环点连通度。 The relation between cyclic edge-connectivity and cyclic connectivity of a 3-regular connected graph G is studied.It is proved that the cyclic edge-connectivity of G is equal to its cyclic connectivity.Further,the relation between the cyclic connectivity and the cyclic vertex-connectivity of G is discussed.It is shown that if the vertex number of G is more than 6 times its cyclic connectivity,then its cyclic connectivity is equal to its cyclic vertex-connectivity.
出处 《山东大学学报(理学版)》 CAS CSCD 北大核心 2009年第12期22-24,29,共4页 Journal of Shandong University(Natural Science)
基金 国家自然科学基金资助项目(10831001) 甘肃省教育厅科研资助项目(0712B-02)
关键词 3-正则连通图 环边连通度 环连通度 环点连通度 3-regular connected graph cyclic edge-connectivity cyclic connectivity cyclic vertex-connectivity
  • 相关文献

参考文献16

  • 1TAIT P G. Remarks on the Colouring of Maps[J]. Proc Royal Soc Edinburgh, 1880, 10:501-503.
  • 2ALDRED R E L, HOLTON D A, JACKSON B. Uniform cyclic edge connectivity in cubic graphs[J]. Combin, 1991, 11:81-96.
  • 3ALDRED B, BAU S, HOLTON D A, et al. Nonhamihonian 3-connected cubic planar graphs[J]. SIAM J Discrete Math, 2000, 13:25- 32.
  • 4CELMINS U A. On cubic graphs that do not have an edge-3-colouring[D]. Waterloo, Canada: Department of Combinatorics and Optimization, University of Waterloo, 1984.
  • 5FLEISCHNER H. Cycle decompositions, 2-coverings, removable cycles and the four-color disease[C]// Bondy J A, Murty U S R. Progress in Graph Theory. New York: Academic Press, 1984: 233-246.
  • 6FLEISCHNER H, JACKSON B. A note concerning come conjectures on cyclically 4-edge connected 3-regular graphs[J]. Annals of Disc Math, 1989, 41:71-178.
  • 7JAEGER F, SWART T. Conjecture I[C]//Deza M, Rosenberg I G. Combinatorics 79, Ann's of Discrete Mathematics: Vol.9. Amsterdam: North-Holland, 1980: 305.
  • 8KOCHOL M. A cyclically 6-edge-connected snark of order 118[J]. Discrete Math, 1996, 161:297-300.
  • 9KOCHOL M. Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks[J]. J Combin Theory: Ser B, 2004, 90:139-145.
  • 10LDVASZ L, PLUMMER M D. Matching Theory[M]//Annals of Discrete Mathematics 29. Amsterdam: North-Hollond, 1986.

同被引文献2

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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