Large Contractible Subgraphs of a 3-Connected Graph
Let m ≥ 5 be a positive integer and let G be a 3-connected graph on at least 2m + 1 vertices. We prove that G has a contractible set W such that m ≤ W ≤ 2m − 4. (Recall that a set W ⊂ V (G) of a 3-connected graph G is contractible if the graph G(W ) is connected and the graph G − W is 2-connected.)...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2021-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2172 |