A weaker version of Lovász' path removal conjecture
From MaRDI portal
Publication:947724
DOI10.1016/j.jctb.2007.11.003zbMath1171.05028OpenAlexW2130764977MaRDI QIDQ947724
Orlando Lee, Ken-ichi Kawarabayashi, Paul Wollan, Bruce A. Reed
Publication date: 7 October 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2007.11.003
Related Items
Nonseparating Cycles Avoiding Specific Vertices ⋮ Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ Removable paths and cycles with parity constraints ⋮ Non-separating even cycles in highly connected graphs ⋮ What is on his mind? ⋮ Extremal infinite graph theory ⋮ Note on non-separating and removable cycles in highly connected graphs ⋮ Removable cycles in non-bipartite graphs ⋮ The Kelmans-Seymour conjecture. IV: A proof
Cites Work
- Unnamed Item
- Unnamed Item
- Partitions of graphs with high minimum degree or connectivity.
- An improved linear edge bound for graph linkages
- Non-separating paths in 4-connected graphs
- Graph connectivity after path removal
- Normal hypergraphs and the perfect graph conjecture. (Reprint)
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Induced paths in 5-connected graphs
- Graph decomposition with applications to subdivisions and path systems modulo k
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- Nonseparating cycles inK-Connected graphs
- On removable cycles through every edge
- The Erdős-Pósa property for odd cycles in graphs of large connectivity
