scientific article; zbMATH DE number 617570

zbMATH Open0801.05030MaRDI QIDQ4301892FDOQ4301892

Authors: Gary Gordon, L. Traldi 

Publication date: 3 October 1994

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

directed graphspolynomialsarborescencesone-variable greedoid polynomial

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• Digraph analogues of the Tutte polynomial
• Tutte polynomials for directed graphs
• A Tutte polynomial which distinguishes rooted unicyclic graphs
• Refined node polynomials via long edge graphs
• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
• On the cover polynomial of a digraph
• Fourientations and the Tutte polynomial
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• Acyclic polynomials of graphs
• Generalized activities and \(K\)-terminal reliability
• 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)