We show that if the arc-connectivity of a directed graph D is at most
⌊k...
The orientation theorem of Nash-Williams states that an undirected graph...
We say that a tree T is an S-Steiner tree if S ⊆ V(T) and a
hypergraph i...
We present a slight generalization of the result of Kamiyama and Kawase
...
We show that the problem of deciding whether a given graph G has a
well-...
We consider two possible extensions of a theorem of Thomassen characteri...
Given a mixed hypergraph ℱ=(V,𝒜∪ℰ),
functions f,g:V→ℤ_+ and an integer k...
We attempt to generalize a theorem of Nash-Williams stating that a graph...
Durand de Gevigney and Szigeti <cit.> have recently given a min-max
theo...