Publication:4386300
From MaRDI portal
zbMath0974.05039MaRDI QIDQ4386300
Publication date: 25 August 1998
mixed graph; strongly connected orientation; crossing submodular functions; feasibility theorem for submodular flows
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
An orientation theorem with parity conditions, Graph orientations with set connectivity requirements, Recent results on well-balanced orientations, Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs, On the \(k\)-orientability of random graphs, Combined connectivity augmentation and orientation problems, Increasing digraph arc-connectivity by arc addition, reversal and complement, The edge-orientation problem and some of its variants on weighted graphs