A tight Erdős-Pósa function for planar minors

DOI10.1137/1.9781611975482.90zbMath1434.05145OpenAlexW3123892561MaRDI QIDQ5236274

Gwenaël Joret, Jean-Florent Raymond, Wouter Cames van Batenburg, Tony Huynh

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611975482.90

zbMATH Keywords

approximation algorithm for packing subgraphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Related Items (4)

Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ Erdös--Pósa from Ball Packing ⋮ Jones' conjecture in subcubic graphs

This page was built for publication: A tight Erdős-Pósa function for planar minors