Graph orientations with edge-connection and parity constraints

A. Frank, Zoltán Király

Research output: Contribution to journalArticle

12 Citations (Scopus)

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 languageEnglish
Pages (from-to)47-70
Number of pages24
JournalCombinatorica
Volume22
Issue number1
DOIs
Publication statusPublished - 2002

Fingerprint

Parity
Odd
Edge-disjoint Paths
Combinatorial optimization
Graph in graph theory
Vertex of a graph
Connectivity
Network Flow
Combinatorial Optimization
Undirected Graph
Digraph
Connected graph
Corollary
Branch
Roots
Subset
Requirements

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

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

In: Combinatorica, Vol. 22, No. 1, 2002, p. 47-70.

Research output: Contribution to journalArticle

Frank, A. ; Király, Zoltán. / Graph orientations with edge-connection and parity constraints. In: Combinatorica. 2002 ; Vol. 22, No. 1. pp. 47-70.
@article{96e7f33f4ef145c2ac1ba53465a3e26c,
title = "Graph orientations with edge-connection and parity constraints",
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.",
author = "A. Frank and Zolt{\'a}n Kir{\'a}ly",
year = "2002",
doi = "10.1007/s004930200003",
language = "English",
volume = "22",
pages = "47--70",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "1",

}

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

VL - 22

SP - 47

EP - 70

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 1

ER -