|
|||||
|
|
Non-separating even cycles in highly connected graphs |
|
| Authors: | Shinya Fujita Ken-ichi Kawarabayashi |
| Affiliation: | 1. Department of Mathematics, Gunma National College of Technology, 580 Toriba, Maebashi Gunma, 371-8530, Japan |
| Abstract: | We prove that every k-connected graph (k ≥ 5) has an even cycle C such that G-V (C) is still (k-4)-connected. The connectivity bound is best possible. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |