Simultaneous well-balanced orientations of graphs

Authors:
Zoltán Király;Zoltán Szigeti
Affiliations:
Department of Computer Science, and CNL (Communication Networks Lab), Eötvös University, Budapest, Hungary;Equipe Combinatoire et Optimisation, Université Paris, Paris cedex, France
Venue:
Journal of Combinatorial Theory Series B
Year:
2006

Citing 4
Cited 1

Applications of submodular functions

Surveys in combinatorics, 1993
Efficient splitting off algorithms for graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Connectivity and network flows

Handbook of combinatorics (vol. 1)
Two-connected orientations of Eulerian graphs

Journal of Graph Theory

Recent results on well-balanced orientations

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nash-Williams' well-balanced orientation theorem [C.St.J.A. Nash-Williams, On orientations, connectivity and odd-vertex-pairings in finite graphs, Canad. J. Math. 12 (1960) 555-567] is extended for orienting several graphs simultaneously.We prove that if G1,...,Gk are pairwise edge-disjoint subgraphs of a graph G, then G has a well-balanced orientation G→ such that the inherited orientations Gi→ of Gi are well-balanced for all 1 ≤ i ≤ k. We also have new results about simultaneous well-balanced orientations of non-disjoint subgraphs of an Eulerian graph as well as those of different contractions of a graph.