3-restricted edge cut of graphs (Q854600): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Fu Ji Zhang / rank
Normal rank
 
Property / author
 
Property / author: Fu Ji Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:23, 5 March 2024

scientific article
Language Label Description Also known as
English
3-restricted edge cut of graphs
scientific article

    Statements

    3-restricted edge cut of graphs (English)
    0 references
    0 references
    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 references

    Identifiers