Local structure of 7- and 8-connected graphs
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.
KeywordsRussia 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.
Unable to display preview. Download preview PDF.
- 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
© Springer Science+Business Media, Inc. 2011