Series-parallel posets and the Tutte polynomial

DOI10.1016/0012-365X(95)00037-WzbMath0859.06001MaRDI QIDQ1815311

Gary Gordon

Publication date: 7 November 1996

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Tutte polynomialorder idealseries-parallel posets

Mathematics Subject Classification ID

Partial orders, general (06A06)

Related Items (5)

Interval partitions and activities for the greedoid Tutte polynomial ⋮ When bad things happen to good trees ⋮ Riordan posets and associated incidence matrices ⋮ Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations ⋮ Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations

Cites Work

• Unnamed Item
• Unnamed Item
• A Tutte polynomial for partially ordered sets
• The complexity of computing the Tutte polynomial on transversal matroids
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Searching in Trees, Series-Parallel and Interval Orders
• A Greedoid Polynomial Which Distinguishes Rooted Arborescences
• The Complexity of Enumeration and Reliability Problems
• The Recognition of Series Parallel Digraphs
• Tutte polynomials for trees
• Introduction to Greedoids
• Enumeration of Posets Generated by Disjoint Unions and Ordinal Sums
• On the greedoid polynomial for rooted graphs and rooted digraphs
• On the computational complexity of the Jones and Tutte polynomials

This page was built for publication: Series-parallel posets and the Tutte polynomial