A weaker version of Lovász' path removal conjecture (Q947724): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2130764977 / rank | |||
Normal rank | |||
Revision as of 02:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A weaker version of Lovász' path removal conjecture |
scientific article |
Statements
A weaker version of Lovász' path removal conjecture (English)
0 references
7 October 2008
0 references
The authors prove that there exists a function \(f(k)\) such that for every \(f(k)\)-connected graph \(G\) and for every edge \(e\in E(G)\), there exists an induced cycle \(C\) containing \(e\) such that \(G-E(C)\) is \(k\)-connected. This confirms a weakening of a conjecture of Lovász due to Kriesel.
0 references
connectivity
0 references
removable paths
0 references
non-separating cycles
0 references
