Advertisement

Journal of Mathematical Sciences

, Volume 179, Issue 5, pp 626–633 | Cite as

Local structure of 7- and 8-connected graphs

  • S. A. Obraztsova
  • A. V. Pastor
Article

We show that if graph on n vertices is minimally and contraction critically k-connected, then it has at least n/2 vertices of degree k for k = 7,8. Bibliography: 17 titles.

Keywords

Russia Local Structure Mathematical Institute Steklov Mathematical Institute Singular Vertex 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Ando, “A local structure theorem on 5-connected graphs,” J. Graph Theory, 60, 99–129 (2009).CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    K. Ando, A. Kaneko, and K. Kawarabayashi, “Vertices of degree 6 in contraction critically 6-connected graphs,” Discr. Math., 273, 55–69 (2003).CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Y. Egawa, “Contractible edges in n-connected graphs with minimum degree greater than or equal to \( \frac{{5n}}{4} \),” Graphs Combin., 7, 15–21 (1991).CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    R. Halin, “A theorem on n-connected graphs,” J. Comb. Theory, 7, 150–154 (1969).CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    R. Halin, “On the structure of n-connected graphs,” in: (W. T. Tutte, ed.), Recent Progress in Combinatorics, Academic Press, London-New York (1969), pp. 91–102.Google Scholar
  6. 6.
    M. Fontet, “Graphes 4-essentiels,” C. R. Acad. Sci. Paris, Ser. A, 287, 289–290 (1978).zbMATHMathSciNetGoogle Scholar
  7. 7.
    M. Kriesell, “A degree sum condition for the existence of a contractible edge in a k-connected graph,” J. Combin. Theory, Ser. B, 82, 81–101 (2001).CrossRefzbMATHMathSciNetGoogle Scholar
  8. 8.
    N. Martinov, “A recursive characterization of the 4-connected graphs,” Discr. Math., 84, 105–108 (1990).CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
    W. Mader, “Ecken Vom Gard n in minimalen n-fach zusammenhangenden Graphen,” Arch. Math., 23, 219–224 (1972).CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    C. Qin, X. Yuan, and J. Su, “Some properties of contraction critical 5-connected graphs,” Discr. Math., 308, 5742–5756 (2008).CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    C. Qin, X. Yuan, and J. Su, “Triangles in contraction critical 5-coonected graphs,” Austr. J. Combin., 33, 139–146 (2005).zbMATHMathSciNetGoogle Scholar
  12. 12.
    C. Thomassen, “Nonseparating cycles in k-connected graphs,” J. Graph Theory, 5, 351–354 (1981).CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    W. T. Tutte, “A theory of 3-connected graphs,” Indag. Math., 23, 441–455 (1961).MathSciNetGoogle Scholar
  14. 14.
    X. Yuan and J. Su, “Contractible edges in 7-connected graphs,” Graphs Combin., 21, 445–457 (2005).CrossRefzbMATHMathSciNetGoogle Scholar
  15. 15.
    M. Li, X. Yuan, and J. Su, “The number of vertices of degree 7 in a contraction critical 7-connected graph,” Discr. Math., 308, 6262–6268 (2008).CrossRefzbMATHMathSciNetGoogle Scholar
  16. 16.
    D. V. Karpov and A. V. Pastor, “Structure of a k-connected graph,” Zap. Nauchn. Semin. POMI, 266, 76–106 (2000).zbMATHGoogle Scholar
  17. 17.
    S. A. Obraztsova, “Local structure of 5- and 6-connected graphs,” Zap. Nauchn. Semin. POMI, 381, 88–96 (2010).MathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2011

Authors and Affiliations

  1. 1.St. Petersburg Department of the Steklov Mathematical InstituteSt. PetersburgRussia

Personalised recommendations