On the greedoid polynomial for rooted graphs and rooted digraphs

DOI10.1002/JGT.3190170316zbMATH Open0781.05026OpenAlexW2155463271WikidataQ56502746 ScholiaQ56502746MaRDI QIDQ4201398FDOQ4201398

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

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

zbMATH Keywords

directed cyclerooted graphgreedoid polynomialbranching greedoidrooted directed graph

Mathematics Subject Classification ID

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

Cites Work

• Introduction to Greedoids

Cited In (10)

• A branching greedoid for multiply-rooted graphs and digraphs
• Series-parallel posets and the Tutte polynomial
• The circuit polynomial of the restricted rooted product \(G(\Gamma )\) of graphs with a bipartite core \(G\)
• A Tutte polynomial which distinguishes rooted unicyclic graphs
• Branchings in rooted graphs and the diameter of greedoids
• Factorisation of greedoid polynomials of rooted digraphs
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• When bad things happen to good trees
• A geometric proof for the root-independence of the greedoid polynomial of Eulerian branching greedoids
• Interval partitions and activities for the greedoid Tutte polynomial

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)