A Greedoid Polynomial Which Distinguishes Rooted Arborescences

DOI10.2307/2047815zbMath0677.05036OpenAlexW4229732500MaRDI QIDQ3832597

Gary Gordon, Elizabeth W. McMahon

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2047815

zbMATH Keywords

Tutte polynomialgreedoid polynomialrooted digraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Related Items (16)

Arborescences of covering graphs ⋮ Markov-Dyck shifts, neutral periodic points and topological conjugacy ⋮ Polynomial invariants for trees. A statistical mechanics approach ⋮ Abelian sandpile model and Biggs-Merino polynomial for directed graphs ⋮ Recovering a tree from the lengths of subtrees spanned by a randomly chosen sequence of leaves ⋮ Polynomial invariants for cactuses ⋮ A rooted variant of Stanley's chromatic symmetric function ⋮ On Brylawski's generalized duality ⋮ On the smallest trees with the same restricted \(U\)-polynomial and the rooted \(U\)-polynomial ⋮ Expected rank in antimatroids ⋮ Interval partitions and activities for the greedoid Tutte polynomial ⋮ Non-isomorphic caterpillars with identical subtree data ⋮ A Tutte polynomial which distinguishes rooted unicyclic graphs ⋮ Factorisation of greedoid polynomials of rooted digraphs ⋮ Series-parallel posets and the Tutte polynomial ⋮ Linear relations for a generalized Tutte polynomial

Cites Work

• Homotopy properties of greedoids
• Polymatroid greedoids
• Introduction to Greedoids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Greedoid Polynomial Which Distinguishes Rooted Arborescences