Title of article :
Contractible Cycles in Graphs with Girth at Least 5
Author/Authors :
Egawa، نويسنده , , Yoshimi، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1998
Abstract :
Letk⩾3 be an integer. We show that ifGis ak-connected graph with girth at least 5, thenGhas an induced cycleQsuch thatG−V(Q) is (k−1)-connected.
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
