|
|||||
|
|
Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph |
|
| Institution: | Department of Applied Mathematics, Science University of Tokyo, Shinjuku-ku, Tokyo, 162 Japan |
| Abstract: | It is shown that for k ≥ 3, every k-connected graph G with girth at least 4 contains an induced cycle C such that G − V(C) is (k − 2)-connected. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |