Journal of Mathematical Sciences

, Volume 212, Issue 6, pp 698–707

On the Structure of C3-Critical Minimal 6-Connected Graphs

Article

DOI: 10.1007/s10958-016-2700-x

Cite this article as:
Pastor, A.V. J Math Sci (2016) 212: 698. doi:10.1007/s10958-016-2700-x
  • 17 Downloads

In this paper, C3-critical minimal 6-connected graphs are studied; they are defined as 6-connected graphs, any subgraph of which obtained by edge deletion is not 6-connected and in which any clique on at most 3 vertices is contained in a 6-cutset. It is proved that more than\( \frac{5}{9} \)of all vertices of such a graph have degree 6. Bibliography: 18 titles.

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  1. 1.St. Petersburg Department of the Steklov Mathematical InstituteSt. Petersburg State Polytechnic UniversitySt. PetersburgRussia

Personalised recommendations