A characteristic polynomial for rooted mixed graphs

An arborescence in a rooted mixed graph Ωr is a tree in which every directed edge is directed away from the root. The collection of arborescences in a rooted mixed graph forms the feasible sets of a greedoid called the branching greedoid of Ωr. We give a graph theoretical characterization of the characteristic polynomial of a mixed branching greedoid.