Title of article
A note on fragile graphs Original Research Article
Author/Authors
Guantao Chen، نويسنده , , Xingxing Yu، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
3
From page
41
To page
43
Abstract
In this note, we show that every graph on n vertices and at most 2n−4 edges contains a vertex-cut S which is also an independent set of G. The result is best possible and answers a question proposed by Caro in the affirmative.
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950045
Link To Document