Succinct Euler-Tour Trees

We show how a collection of Euler-tour trees for a forest on $n$ vertices can be stored in $2n+o(n)$ bits such that simple queries take constant time, more complex queries take logarithmic time and updates take polylogarithmic amortized time.