| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657311 | Journal of Combinatorial Theory, Series B | 2008 | 8 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
