### Abstract

Parity (matching theory) and connectivity (network flows) are two main branches of combinatorial optimization. In an attempt to understand better their interrelation, we study a problem where both parity and connectivity requirements are imposed. The main result is a characterization of undirected graphs G = (V, E) having a k-edge-connected T-odd orientation for every subset T ⊆ V with |E| + |T| even. (T-odd orientation: the in-degree of v is odd precisely if v is in T.) As a corollary, we obtain that every (2k)-edge-connected graph with |V| + |E| even has a (k - 1)-edge-connected orientation in which the in-degree of every node is odd. Along the way, a structural characterization will be given for digraphs with a root-node s having k edge-disjoint paths from s to every node and k-1 edge-disjoint paths from every node to s.

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

Pages (from-to) | 47-70 |

Number of pages | 24 |

Journal | Combinatorica |

Volume | 22 |

Issue number | 1 |

DOIs | |

Publication status | Published - 2002 |

### Fingerprint

### ASJC Scopus subject areas

- Mathematics(all)
- Discrete Mathematics and Combinatorics

### Cite this

*Combinatorica*,

*22*(1), 47-70. https://doi.org/10.1007/s004930200003

**Graph orientations with edge-connection and parity constraints.** / Frank, A.; Király, Zoltán.

Research output: Contribution to journal › Article

*Combinatorica*, vol. 22, no. 1, pp. 47-70. https://doi.org/10.1007/s004930200003

}

TY - JOUR

T1 - Graph orientations with edge-connection and parity constraints

AU - Frank, A.

AU - Király, Zoltán

PY - 2002

Y1 - 2002

N2 - Parity (matching theory) and connectivity (network flows) are two main branches of combinatorial optimization. In an attempt to understand better their interrelation, we study a problem where both parity and connectivity requirements are imposed. The main result is a characterization of undirected graphs G = (V, E) having a k-edge-connected T-odd orientation for every subset T ⊆ V with |E| + |T| even. (T-odd orientation: the in-degree of v is odd precisely if v is in T.) As a corollary, we obtain that every (2k)-edge-connected graph with |V| + |E| even has a (k - 1)-edge-connected orientation in which the in-degree of every node is odd. Along the way, a structural characterization will be given for digraphs with a root-node s having k edge-disjoint paths from s to every node and k-1 edge-disjoint paths from every node to s.

AB - Parity (matching theory) and connectivity (network flows) are two main branches of combinatorial optimization. In an attempt to understand better their interrelation, we study a problem where both parity and connectivity requirements are imposed. The main result is a characterization of undirected graphs G = (V, E) having a k-edge-connected T-odd orientation for every subset T ⊆ V with |E| + |T| even. (T-odd orientation: the in-degree of v is odd precisely if v is in T.) As a corollary, we obtain that every (2k)-edge-connected graph with |V| + |E| even has a (k - 1)-edge-connected orientation in which the in-degree of every node is odd. Along the way, a structural characterization will be given for digraphs with a root-node s having k edge-disjoint paths from s to every node and k-1 edge-disjoint paths from every node to s.

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

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

U2 - 10.1007/s004930200003

DO - 10.1007/s004930200003

M3 - Article

AN - SCOPUS:0036435028

VL - 22

SP - 47

EP - 70

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -