Research output: Contribution to journal › Article › peer-review
Let G be a 2-connected graph, and let W be a set of internal vertices of block parts of G that contains at least one vertex in each of these parts. It is proved that the graph G−W is 2-connected.
Original language | English |
---|---|
Pages (from-to) | 683-687 |
Number of pages | 5 |
Journal | Journal of Mathematical Sciences (United States) |
Volume | 212 |
Issue number | 6 |
Early online date | 7 Jan 2016 |
DOIs | |
State | Published - 1 Feb 2016 |
ID: 36925121