2 papers
cs.DS2021
FPT algorithms for packing -safe spanning rooted sub(di)graphs
Stéphane Bessy, Florian Hörsch, Ana Karolinna Maia +2
We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput. Sci. 2015] and by Bang-Jensen, Havet, and Yeo [Discret. Appl. Math. 2016] about finding disjoint "balanced…
math.CO2020
Connectivity of orientations of 3-edge-connected graphs
Florian Hörsch, Zoltán Szigeti
We attempt to generalize a theorem of Nash-Williams stating that a graph has a -arc-connected orientation if and only if it is -edge-connected. In a strongly connected digra…