research
∙
05/02/2023
On reversing arcs to improve arc-connectivity
We show that if the arc-connectivity of a directed graph D is at most ⌊k...
share
research
∙
04/28/2023
Directed hypergraph connectivity augmentation by hyperarc reorientations
The orientation theorem of Nash-Williams states that an undirected graph...
research
∙
11/04/2022
Steiner connectivity problems in hypergraphs
We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a hypergraph i...
research
∙
03/02/2022
On packing time-respecting arborescences
We present a slight generalization of the result of Kamiyama and Kawase ...
research
∙
02/28/2022
On the complexity of finding well-balanced orientations with upper bounds on the out-degrees
We show that the problem of deciding whether a given graph G has a well-...
research
∙
12/14/2021
A note on 2-vertex-connected orientations
We consider two possible extensions of a theorem of Thomassen characteri...
research
∙
12/27/2020
Packing of mixed hyperarborescences with flexible roots via matroid intersection
Given a mixed hypergraph ℱ=(V,𝒜∪ℰ), functions f,g:V→ℤ_+ and an integer k...
research
∙
12/06/2020
Connectivity of orientations of 3-edge-connected graphs
We attempt to generalize a theorem of Nash-Williams stating that a graph...
research
∙
04/18/2020
