On the orientation of graphs
From MaRDI portal
Publication:1144041
DOI10.1016/0095-8956(80)90071-4zbMath0443.05045OpenAlexW2010006094MaRDI QIDQ1144041
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90071-4
Related Items
Eulerian Orientations and Circulations ⋮ Degree complete graphs ⋮ Base polyhedra and the linking property ⋮ Algorithms for finding a rooted \((k,1)\)-edge-connected orientation ⋮ Generalized polymatroids and submodular flows ⋮ On orientations and shortest paths ⋮ Shattering, graph orientations, and connectivity ⋮ Constructive characterizations for packing and covering with trees ⋮ On the orientation of graphs and hypergraphs ⋮ Combined connectivity augmentation and orientation problems ⋮ Approximating Minimum Cost Connectivity Orientation and Augmentation ⋮ A Survey on Covering Supermodular Functions ⋮ A note on k-strongly connected orientations of an undirected graph ⋮ The ellipsoid method and its consequences in combinatorial optimization ⋮ The constructive characterization of \((k,l)\)-edge-connected digraphs ⋮ Tree-compositions and orientations ⋮ Recent results on well-balanced orientations ⋮ Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs ⋮ The parity problem of polymatroids without double circuits ⋮ A note on parity constrained orientations ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ On the \(k\)-orientability of random graphs ⋮ Path Partitions, Cycle Covers and Integer Decomposition ⋮ Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ Orientations and detachments of graphs with prescribed degrees and connectivity ⋮ On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
Cites Work
