Pages that link to "Item:Q1165861"
From MaRDI portal
The following pages link to Konstruktion aller n-fach kantenzusammenhaengenden Digraphen (Q1165861):
Displaying 24 items.
- Immersing complete digraphs (Q427820) (← links)
- The directed orienteering problem (Q547309) (← links)
- The constructive characterization of \((k,l)\)-edge-connected digraphs (Q653995) (← links)
- Submodular functions in graph theory (Q686469) (← links)
- Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
- On constructive characterizations of \((k,l)\)-sparse graphs (Q852713) (← links)
- Minimizing a monotone concave function with laminar covering constraints (Q943837) (← links)
- Recent results on well-balanced orientations (Q955324) (← links)
- Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) (Q1066160) (← links)
- Constructive characterizations for packing and covering with trees (Q1410688) (← links)
- Combined connectivity augmentation and orientation problems (Q1410691) (← links)
- Edge splitting and connectivity augmentation in directed hypergraphs. (Q1417568) (← links)
- Splitting off edges between two subsets preserving the edge-connectivity of the graph. (Q1422410) (← links)
- A constant-factor approximation for directed latency in quasi-polynomial time (Q2119400) (← links)
- Balancing two spanning trees (Q3087621) (← links)
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs (Q3794218) (← links)
- Extremal graphs in connectivity augmentation (Q4256090) (← links)
- Paths, cycles, and arc‐connectivity in digraphs (Q4698084) (← links)
- Highly edge-connected detachments of graphs and digraphs (Q4808407) (← links)
- Cycle decompositions and constructive characterizations (Q5009962) (← links)
- Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs (Q5219669) (← links)
- A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time (Q5874522) (← links)
- Bipartition constrained edge-splitting in directed graphs (Q5954237) (← links)
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties (Q6057659) (← links)