A weaker version of Lovász' path removal conjecture

Authors:
Ken-ichi Kawarabayashi;Orlando Lee;Bruce Reed;Paul Wollan
Affiliations:
Graduate School of Information Sciences (GSIS), Tohoku University, Aramaki aza Aoba 09, Aoba-ku Sendai, Miyagi 980-8579, Japan;University of Campinas (UNICAMP), Brazil;Canada Research Chair in Graph Theory, McGill University, Montreal, Canada and Laboratoire I3S, CNRS, Sophia-Antipolis, France;University of Waterloo, Waterloo, Canada
Venue:
Journal of Combinatorial Theory Series B
Year:
2008

Citing 5
Cited 4

Partitions of graphs with high minimum degree or connectivity

Journal of Combinatorial Theory Series B
Graph Connectivity After Path Removal

Combinatorica
An improved linear edge bound for graph linkages

European Journal of Combinatorics - Special issue: Topological graph theory II
Induced paths in 5-connected graphs

Journal of Graph Theory
On removable cycles through every edge

Journal of Graph Theory

Note: Note on non-separating and removable cycles in highly connected graphs

Discrete Applied Mathematics
Removable cycles in non-bipartite graphs

Journal of Combinatorial Theory Series B
Non-separating subgraphs after deleting many disjoint paths

Journal of Combinatorial Theory Series B
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

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 Lovasz due to Kriesell.