scientific article; zbMATH DE number 617570

MaRDI QIDQ4301892zbMATH OpenFDO

Authors Gary Gordon, L. Traldi

Publication date 3 October 1994

zbMATH Keywords

arborescencesdirected graphsone-variable greedoid polynomialpolynomials

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• Digraph analogues of the Tutte polynomial
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• On the greedoid polynomial for rooted graphs and rooted digraphs
• Tutte polynomials for directed graphs

Cited in

(13)

• A Tutte polynomial which distinguishes rooted unicyclic graphs
• Generalized activities and \(K\)-terminal reliability
• On the cover polynomial of a digraph
• Tutte polynomials for directed graphs
• Fourientations and the Tutte polynomial
• Refined node polynomials via long edge graphs
• scientific article; zbMATH DE number 4012647 (Why is no real title available?)
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• On the greedoid polynomial for rooted graphs and rooted digraphs
• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
• Acyclic polynomials of graphs
• Digraph analogues of the Tutte polynomial
• Root polytopes and Jaeger‐type dissections for directed graphs

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 Q4301892)