### Abstract

In this paper, we show the Erdos-Pósa property for edge-disjoint packing of S-closed walks with parity constraints in 4-edge-connected graphs. More precisely, we prove that for any 4-edge-connected graph G and any vertex subset S, either G has k edge-disjoint elementary closed odd walks, each of which has at least one vertex of S, or G has an edge set F with |F| ≥ f(k) such that G - F has no such walks. The 4-edge-connectivity is the best possible in the sense that 3-edge-connected graphs do not satisfy the statement. Since the proof is constructive, we can design a fixed-parameter algorithm for finding k edge-disjoint walks satisfying the conditions in a 4-edge-connected graph for a parameter k. In addition, this gives a simple fixed-parameter algorithm for the parity edge-disjoint walks problem with k terminal pairs.

Original language | English |
---|---|

Pages (from-to) | 766-782 |

Number of pages | 17 |

Journal | SIAM Journal on Discrete Mathematics |

Volume | 31 |

Issue number | 2 |

DOIs | |

Publication status | Published - 2017 Jan 1 |

### Keywords

- Cycle packing
- Erdos-Pósa property
- Fixed-parameter algorithm

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs'. Together they form a unique fingerprint.

## Cite this

*SIAM Journal on Discrete Mathematics*,

*31*(2), 766-782. https://doi.org/10.1137/15M1022239