Mangoes and blueberries

DOI10.1007/s004930050056zbMath0928.05059OpenAlexW1514063965MaRDI QIDQ1125684

Bruce A. Reed

Publication date: 20 December 1999

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004930050056

zbMATH Keywords

packingbipartite graphsodd cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Related Items

Edge-disjoint odd cycles in 4-edge-connected graphs ⋮ Rooted grid minors ⋮ The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Approximate min-max relations for odd cycles in planar graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Erdös-Pósa Property of Obstructions to Interval Graphs ⋮ Packing Edge-Disjoint Odd Eulerian Subgraphs Through Prescribed Vertices in 4-Edge-Connected Graphs ⋮ Packing cycles in undirected group-labelled graphs ⋮ Erdős–Pósa property of obstructions to interval graphs ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Erdős-Pósa property of chordless cycles and its applications ⋮ Unnamed Item ⋮ Edge-disjoint odd cycles in planar graphs. ⋮ Packing cycles with modularity constraints ⋮ Chordless Cycle Packing Is Fixed-Parameter Tractable ⋮ On the strong and the semi-strong path partition conjecture ⋮ Planar graph bipartization in linear time ⋮ Half-integral packing of odd cycles through prescribed vertices ⋮ Finding odd cycle transversals. ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Packing and covering odd cycles in cubic plane graphs with small faces ⋮ Packing and covering odd cycles in cubic plane graphs with small faces ⋮ Revisiting a theorem by Folkman on graph colouring ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ 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 ⋮ Induced packing of odd cycles in planar graphs ⋮ Frustration-critical signed graphs ⋮ Graphs without two vertex-disjoint \(S\)-cycles ⋮ Monotone maps, sphericity and bounded second eigenvalue ⋮ Unnamed Item ⋮ Fixed-parameter tractability for subset feedback set problems with parity constraints ⋮ Non-zero disjoint cycles in highly connected group labeled graphs ⋮ The computational complexity of three graph problems for instances with bounded minors of constraint matrices