Title of article
A weaker version of Lovلszʹ path removal conjecture
Author/Authors
Kawarabayashi، نويسنده , , Ken-ichi and Lee، نويسنده , , Orlando and Reed، نويسنده , , Bruce and Wollan، نويسنده , , Paul، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
8
From page
972
To page
979
Abstract
We prove there exists a function f ( k ) such that for every f ( k ) -connected graph G and for every edge e ∈ E ( G ) , there exists an induced cycle C containing e such that G − E ( C ) is k-connected. This proves a weakening of a conjecture of Lovász due to Kriesell.
Keywords
graph connectivity , Removable paths , Non-separating cycles
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series B
Record number
1528738
Link To Document