Factorisation of greedoid polynomials of rooted digraphs
Gordon and McMahon defined a two-variable greedoid polynomial f(G; t, z) for any greedoid G. They studied greedoid polynomials for greedoids associated with rooted graphs and rooted digraphs. They proved that greedoid polynomials of rooted digraphs have the multiplicative direct sum property. In add...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
Springer
2021
|