3-restricted edge cut of graphs (Q854600)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5077527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | 3-restricted edge cut of graphs |
scientific article; zbMATH DE number 5077527 |
Statements
3-restricted edge cut of graphs (English)
0 references
6 December 2006
0 references
A 3-restricted edge cut is an edge cut that separates a connetced graph into a disconnected one with components having order a least 3. The authors characterized graphs which have a 3-restricted edge cut. Reviewers remark: This characterization is well known. It can be found in the paper [\textit{P. Bonsma, N. Ueffing} and \textit{L. Volkmann}, Discrete Math. 256, 431--439 (2002; Zbl 1017.05063)].
0 references
0.8365252614021301
0 references
0.8333316445350647
0 references
0.829014241695404
0 references
0.8196388483047485
0 references
