scientific article; zbMATH DE number 952955

MaRDI QIDQ4717853zbMATH OpenFDO

Authors Gary Gordon, Elizabeth McMahon

Publication date 1 December 1996

zbMATH Keywords

characteristic polynomialgreedoidmatroidMöbius function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Chordal graphs and the characteristic polynomial
• On the greedoid polynomial for rooted graphs and rooted digraphs
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• A branching greedoid for multiply-rooted graphs and digraphs

Cited in

(7)

• On the NBC-complexes and \(\beta \)-invariants of abstract convex geometries
• Expected rank in antimatroids
• Linear relations for a generalized Tutte polynomial
• A characteristic polynomial for rooted mixed graphs
• A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
• The complexity of the greedoid Tutte polynomial
• A branching greedoid for multiply-rooted graphs and digraphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717853)