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

DOI10.1016/J.DISC.2006.07.008zbMATH Open1112.05056OpenAlexW2062574277MaRDI QIDQ868342FDOQ868342

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

Recommendations

• The Erdős-Pósa property for odd cycles in highly connected graphs
• 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
• The Erdős-Pósa property for odd cycles in graphs of large connectivity
• Edge-disjoint odd cycles in 4-edge-connected graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (14)

• Non-zero disjoint cycles in highly connected group labeled graphs
• Title not available (Why is that?)
• Packing cycles with modularity constraints
• Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs
• An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\)
• Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
• Packing and covering immersion-expansions of planar sub-cubic graphs
• Non-zero disjoint cycles in highly connected group labelled graphs
• Even A‐cycles have the edge‐Erdős–Pósa property
• Packing and Covering Immersion Models of Planar Subcubic Graphs
• Packing Cycles Faster Than Erdos--Posa
• Strengthening Erdös-Pósa property for minor-closed graph classes
• The Erdős-Pósa property for odd cycles in highly connected graphs
• Recent techniques and results on the Erdős-Pósa property

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868342)