Email this article On the Structure of C3-Critical Minimal 6-Connected Graphs
- Authors: Pastor A.V.1
-
Affiliations:
- St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg State Polytechnic University
- Issue: Vol 212, No 6 (2016)
- Pages: 698-707
- Section: Article
- URL: https://journal-vniispk.ru/1072-3374/article/view/237129
- DOI: https://doi.org/10.1007/s10958-016-2700-x
- ID: 237129
Cite item
Open Access
Access granted
Subscription Access
Abstract
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.
About the authors
A. V. Pastor
St. Petersburg Department of the Steklov Mathematical Institute, St. Petersburg State Polytechnic University
Author for correspondence.
Email: pastor@pdmi.ras.ru
Russian Federation, St. Petersburg
Supplementary files
