The Erdős-Pósa property for odd cycles in graphs of large connectivity
From MaRDI portal
Publication:5955205
DOI10.1007/s004930100028zbMath0989.05062OpenAlexW1975998435WikidataQ56926743 ScholiaQ56926743MaRDI QIDQ5955205
Publication date: 13 February 2002
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004930100028
Related Items (24)
Negative (and positive) circles in signed graphs: a problem collection ⋮ The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ On Modulo Linked Graphs ⋮ Cycles through all finite vertex sets in infinite graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Removable paths and cycles with parity constraints ⋮ \(K_4\)-expansions have the edge-Erdős-Pósa property ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Non-separating even cycles in highly connected graphs ⋮ Packing cycles with modularity constraints ⋮ Linked graphs with restricted lengths ⋮ A weaker version of Lovász' path removal conjecture ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ What is on his mind? ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Packing Cycles Faster Than Erdos--Posa ⋮ Quadratic Upper Bounds on the Erdős-Pósa Property for a Generalization of Packing and Covering Cycles ⋮ Non-zero disjoint cycles in highly connected group labeled graphs
This page was built for publication: The Erdős-Pósa property for odd cycles in graphs of large connectivity
