Factorisation of greedoid polynomials of rooted digraphs
From MaRDI portal
Publication:2053691
DOI10.1007/s00373-021-02347-0zbMath1479.05165arXiv1809.02924OpenAlexW3176891072MaRDI QIDQ2053691
Kai Siong Yow, Kerri Morgan, Graham E. Farr
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.02924
Graph polynomials (05C31) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Interval partitions and activities for the greedoid Tutte polynomial
- Greedoids
- A Tutte polynomial which distinguishes rooted unicyclic graphs
- Contraction-deletion invariants for graphs
- Irreducibility of the Tutte polynomial of a connected matroid
- Polymatroid greedoids
- Certificates of factorisation for chromatic polynomials
- Non-isomorphic caterpillars with identical subtree data
- A Greedoid Polynomial Which Distinguishes Rooted Arborescences
- Introduction to Greedoids
- On the greedoid polynomial for rooted graphs and rooted digraphs
- A Contribution to the Theory of Chromatic Polynomials
- Digraph analogues of the Tutte polynomial