| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9512147 | Discrete Mathematics | 2005 | 7 Pages |
Abstract
An m-restricted edge cut is an edge cut of a connected graph which disconnects this graph with each component having order at least m. Graphs that contain m-restricted edge cuts are characterized in this paper if they have order at least 3m-2. For graphs without this order restriction, we present two necessary and sufficient conditions to determine whether they contain m-restricted edge cuts.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jianping Ou,