Konstruktion aller n-fach kantenzusammenhaengenden Digraphen

DOI10.1016/S0195-6698(82)80009-7zbMath0488.05037MaRDI QIDQ1165861

W. Mader

Publication date: 1982

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

digraph; edge-connectivity; construction of finite digraphs

Mathematics Subject Classification ID

05C20: Directed graphs (digraphs), tournaments

05C40: Connectivity

Related Items

Paths, cycles, and arc‐connectivity in digraphs, Highly edge-connected detachments of graphs and digraphs, Bipartition constrained edge-splitting in directed graphs, Submodular functions in graph theory, Graph connectivity and its augmentation: Applications of MA orderings, On constructive characterizations of \((k,l)\)-sparse graphs, Minimizing a monotone concave function with laminar covering constraints, Recent results on well-balanced orientations, Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected 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, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Ecken vom Innen- und Außengrad \(n\) in minimal \(n\)-fach kantenzusammenhängenden Digraphen
• Eine Reduktionsmethode für den Kantenzusammenhang in Graphen
• A Reduction Method for Edge-Connectivity in Graphs