Abstract#R##N##R##N#We examine some properties of the 2-variable greedoid polynomial f(G·,t,z) when G is the branching greedoid associated to a rooted graph or a rooted directed graph. For rooted digraphs, we show a factoring property of f(G·,t,z) determines whether or not the rooted digraph has a directed cycle. © 1993 John Wiley & Sons, Inc.
['Elizabeth W. McMahon']
On the greedoid polynomial for rooted graphs and rooted digraphs