Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs

Naonori Kakimura, Ken Ichi Kawarabayashi, Yusuke Kobayashi

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)766-782
Number of pages17
JournalSIAM Journal on Discrete Mathematics
Volume31
Issue number2
DOIs
Publication statusPublished - 2017

Fingerprint

Walk
Packing
Connected graph
Subgraph
Disjoint
Odd
Fixed-parameter Algorithms
Parity
Closed
Edge-connectivity
Vertex of a graph
Erdös
Subset

Keywords

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

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs. / Kakimura, Naonori; Kawarabayashi, Ken Ichi; Kobayashi, Yusuke.

In: SIAM Journal on Discrete Mathematics, Vol. 31, No. 2, 2017, p. 766-782.

Research output: Contribution to journalArticle

@article{580c1251b55f4d2ea2d899eb7515d3c6,
title = "Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs",
abstract = "In this paper, we show the Erdos-P{\'o}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.",
keywords = "Cycle packing, Erdos-P{\'o}sa property, Fixed-parameter algorithm",
author = "Naonori Kakimura and Kawarabayashi, {Ken Ichi} and Yusuke Kobayashi",
year = "2017",
doi = "10.1137/15M1022239",
language = "English",
volume = "31",
pages = "766--782",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "2",

}

TY - JOUR

T1 - Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs

AU - Kakimura, Naonori

AU - Kawarabayashi, Ken Ichi

AU - Kobayashi, Yusuke

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

KW - Cycle packing

KW - Erdos-Pósa property

KW - Fixed-parameter algorithm

UR - http://www.scopus.com/inward/record.url?scp=85021888664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85021888664&partnerID=8YFLogxK

U2 - 10.1137/15M1022239

DO - 10.1137/15M1022239

M3 - Article

VL - 31

SP - 766

EP - 782

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 2

ER -