On the greedoid polynomial for rooted graphs and rooted digraphs

DOI10.1002/JGT.3190170316MaRDI QIDQ4201398zbMATH OpenOpenAlexWikidataFDO

Authors Elizabeth McMahon

Publication date 24 August 1993

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190170316

zbMATH Keywords

branching greedoiddirected cyclegreedoid polynomialrooted directed graphrooted graph

Mathematics Subject Classification ID

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

Recommendations

• Factorisation of greedoid polynomials of rooted digraphs
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• A branching greedoid for multiply-rooted graphs and digraphs
• A Tutte polynomial which distinguishes rooted unicyclic graphs
• scientific article; zbMATH DE number 617570

Cites work

• Introduction to Greedoids

Cited in

(12)

• A Tutte polynomial which distinguishes rooted unicyclic graphs
• Branchings in rooted graphs and the diameter of greedoids
• Series-parallel posets and the Tutte polynomial
• Factorisation of greedoid polynomials of rooted digraphs
• The circuit polynomial of the restricted rooted product G( ) of graphs with a bipartite core G
• When bad things happen to good trees
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• scientific article; zbMATH DE number 617570 (Why is no real title available?)
• scientific article; zbMATH DE number 952955 (Why is no real title available?)
• A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
• Interval partitions and activities for the greedoid Tutte polynomial
• A branching greedoid for multiply-rooted graphs and digraphs

This page was built for publication: On the greedoid polynomial for rooted graphs and rooted digraphs

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