Title of article :
How to contract an essentially 6-connected graph to a 5-connected graph Original Research Article
Author/Authors :
Matthias Kriesell، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2007
Pages :
17
From page :
494
To page :
510
Abstract :
It is shown that an essentially 6-connected graph G on at least 13 vertices can be contracted to a 5-connected graph H such that image. The bounds 13 and 5 are sharp, and no such result holds for higher connectivity.
Keywords :
Contraction , Minor , Connectivity
Journal title :
Discrete Mathematics
Serial Year :
2007
Journal title :
Discrete Mathematics
Record number :
947703
Link To Document :
بازگشت