Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
From MaRDI portal
Publication:1165861
DOI10.1016/S0195-6698(82)80009-7zbMath0488.05037MaRDI QIDQ1165861
Publication date: 1982
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Related Items
A constant-factor approximation for directed latency in quasi-polynomial time ⋮ Highly edge-connected detachments of graphs and digraphs ⋮ On constructive characterizations of \((k,l)\)-sparse graphs ⋮ Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties ⋮ Immersing complete digraphs ⋮ Constructive characterizations for packing and covering with trees ⋮ Combined connectivity augmentation and orientation problems ⋮ Edge splitting and connectivity augmentation in directed hypergraphs. ⋮ Splitting off edges between two subsets preserving the edge-connectivity of the graph. ⋮ Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs ⋮ The constructive characterization of \((k,l)\)-edge-connected digraphs ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ Minimizing a monotone concave function with laminar covering constraints ⋮ Recent results on well-balanced orientations ⋮ Submodular functions in graph theory ⋮ Graph connectivity and its augmentation: Applications of MA orderings ⋮ The directed orienteering problem ⋮ Bipartition constrained edge-splitting in directed graphs ⋮ Extremal graphs in connectivity augmentation ⋮ Paths, cycles, and arc‐connectivity in digraphs ⋮ Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs ⋮ Balancing two spanning trees ⋮ Cycle decompositions and constructive characterizations ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs)
Cites Work
