|
Zapiski Nauchnykh Seminarov POMI, 2018, Volume 475, Pages 22–40
(Mi znsl6684)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
On contractible 5-vertex subgraphs of a 3-connected graph
N. Yu. Vlasova St. Petersburg State University, Mathematics and Mechanics Faculty, St. Petersburg, Russia
Abstract:
A subset $H$ of the set of vertices of a $3$-connected finite graph $G$ is called contractible if $G(H)$ is connected and $G - H$ is
$2$-connected. We prove that every $3$-connected graph on at least $11$ vertices with minimal degree at least $4$ has a contractible set on $5$ vertices.
Key words and phrases:
connectivity, $3$-connected graph, contractible subgraph.
Received: 12.11.2018
Citation:
N. Yu. Vlasova, “On contractible 5-vertex subgraphs of a 3-connected graph”, Combinatorics and graph theory. Part X, Zap. Nauchn. Sem. POMI, 475, POMI, St. Petersburg, 2018, 22–40
Linking options:
https://www.mathnet.ru/eng/znsl6684 https://www.mathnet.ru/eng/znsl/v475/p22
|
Statistics & downloads: |
Abstract page: | 116 | Full-text PDF : | 45 | References: | 30 |
|