1 citations · 1 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023★ 1 cited
The complexity of the greedoid Tutte polynomial
Christopher Knapp, Steven Noble
We consider the Tutte polynomial of three classes of greedoids: those arising from rooted graphs, rooted digraphs and binary matrices. We establish the computational complexity of…
math.CO2023
Tensor products of multimatroids and a Brylawski-type formula for the transition polynomial
Iain Moffatt, Steven Noble, Maya Thompson
Brylawski's tensor product formula expresses the Tutte polynomial of the tensor product of two graphs or matroids in terms of Tutte polynomials arising from the tensor factors. Ana…