The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces

DOI10.1016/j.disc.2006.07.008zbMath1112.05056OpenAlexW2062574277MaRDI QIDQ868342

Atsuhiro Nakamoto, Ken-ichi Kawarabayashi

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.008

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (10)

Packing and Covering Immersion Models of Planar Subcubic Graphs ⋮ Packing and covering immersion-expansions of planar sub-cubic graphs ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ Packing cycles with modularity constraints ⋮ An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\) ⋮ Non-zero disjoint cycles in highly connected group labelled graphs ⋮ Strengthening Erdös-Pósa property for minor-closed graph classes ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Highly parity linked graphs
• Graph minors. V. Excluding a planar graph
• Mangoes and blueberries
• Grid minors of graphs on the torus
• Edge-disjoint odd cycles in planar graphs.
• Optimal packings of edge-disjoint odd cycles
• Non-zero disjoint cycles in highly connected group labelled graphs
• On the presence of disjoint subgraphs of a specified type
• The Erdős-Pósa property for odd cycles in highly connected graphs
• The Erdős-Pósa property for odd cycles in graphs of large connectivity

This page was built for publication: The Erdős-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces