首页 | 本学科首页   官方微博 | 高级检索  
     


On the Circumference of 3-connected Graphs
Authors:Heinz A. Jung  Elkin Vumar
Affiliation:1. FB 3-Mathematik, MA 8-1, Technische Universit?t Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany
2. FB 3-Mathematik, MA 8-1, Technische Universit?t Berlin, Strasse des 17. Juni 136, 10623, Berlin, Germany
Abstract:Let C be a longest cycle in the 3-connected graph G and let H be a component of G - V(C) such that ¦V(H)¦≥ 3. We supply estimates of the form ¦C¦ ≥ 2d(u) + 2d(v) ? a (4 ≤ a ≤ 8), where u, v are suitably chosen non-adjacent vertices in G.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号