| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420132 | Discrete Applied Mathematics | 2007 | 6 Pages |
Abstract
For every integer k⩾2k⩾2 and graph GG, consider the following natural procedure: if GG has a component G′G′ that is not kk-connected, remove G′G′ if |G′|⩽k|G′|⩽k, otherwise remove a cutset U⊂V(G′)U⊂V(G′) with |U|
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
V. Nikiforov, R.H. Schelp,