|
Zapiski Nauchnykh Seminarov POMI, 2014, Volume 427, Pages 89–104
(Mi znsl6045)
|
|
|
|
About vertices of degree $6$ of $C_3$-critical minimal $6$-connected graph
A. V. Pastorab a St. Petersburg Department of V. A. Steklov Institute of Mathematics of the Russian Academy of Sciences, St. Petersburg, Russia
b St. Petersburg State Polytechnical University, St. Petersburg, Russia
Abstract:
In this paper we research $C_3$-critical minimal $6$-connected graphs, i.e. such $6$-connected graphs, that lost there $6$-connectivity when we delete any edge and in which any clique on at most $3$ verticies is contained in a $6$-cutset. We prove that more than $\frac59$ of all verticies of a such graph has degree $6$.
Key words and phrases:
$k$-connectivity, minimal $k$-connected graph, $C_3$-critical $k$-connected graph.
Received: 20.10.2014
Citation:
A. V. Pastor, “About vertices of degree $6$ of $C_3$-critical minimal $6$-connected graph”, Combinatorics and graph theory. Part VII, Zap. Nauchn. Sem. POMI, 427, POMI, St. Petersburg, 2014, 89–104; J. Math. Sci. (N. Y.), 212:6 (2016), 698–707
Linking options:
https://www.mathnet.ru/eng/znsl6045 https://www.mathnet.ru/eng/znsl/v427/p89
|
Statistics & downloads: |
Abstract page: | 134 | Full-text PDF : | 38 | References: | 34 |
|