On the orientation of graphs

DOI10.1016/0095-8956(80)90071-4MaRDI QIDQ1144041zbMATH OpenOpenAlexFDO

Authors András Frank

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

zbMATH Keywords

digraphgraphminimaxorientationsubmodular

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3604926 (Why is no real title available?)
• scientific article; zbMATH DE number 3334027 (Why is no real title available?)
• On the degrees of the vertices of a directed graph
• On the Problem of Decomposing a Graph into n Connected Factors
• On two minimax theorems in graph

Cited in

(31)

• On the k-orientability of random graphs
• Generalized polymatroids and submodular flows
• On orientations and shortest paths
• A note on k-strongly connected orientations of an undirected graph
• The ellipsoid method and its consequences in combinatorial optimization
• Constructive characterizations for packing and covering with trees
• On the orientation of graphs and hypergraphs
• Combined connectivity augmentation and orientation problems
• Base polyhedra and the linking property
• Decreasing minimization on M-convex sets: background and structures
• Decreasing minimization on M-convex sets: algorithms and applications
• On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
• Orientations and detachments of graphs with prescribed degrees and connectivity
• Degree complete graphs
• Tree-compositions and orientations
• The edge-orientation problem and some of its variants on weighted graphs
• Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
• A Survey on Covering Supermodular Functions
• Path Partitions, Cycle Covers and Integer Decomposition
• Eulerian Orientations and Circulations
• Shattering, graph orientations, and connectivity
• Approximating Minimum Cost Connectivity Orientation and Augmentation
• The constructive characterization of (k,l)-edge-connected digraphs
• On the existence of funneled orientations for classes of rooted phylogenetic networks
• Finding degree-constrained acyclic orientations
• Directed hypergraph connectivity augmentation by hyperarc reorientations
• How to see the forest despite the trees
• 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

This page was built for publication: On the orientation of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144041)