抄録
We prove that every 3-connected graph G of order at least nine has two adjacent edges xy and yz such that the graph obtained from G by contracting x, y, and z into a single vertex is also 3-connected.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 308-314 |
| ページ数 | 7 |
| ジャーナル | Journal of Combinatorial Theory, Series B |
| 巻 | 60 |
| 号 | 2 |
| DOI | |
| 出版ステータス | Published - 1994 3月 |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- 離散数学と組合せ数学
- 計算理論と計算数学