The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions

From MaRDI portal
Publication:1918884

zbMath0857.05046MaRDI QIDQ1918884

Bruce E. Sagan, Ira M. Gessel

Publication date: 21 July 1996

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119042




Related Items (28)

Gončarov polynomials and parking functionsChip-firing game and a partial Tutte polynomial for Eulerian digraphsMacdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functionsParking functions and tree inversions revisitedEnumerative applications of a decomposition for graphs and digraphsOn the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\)Extremal graphs for the Tutte polynomialFourientation activities and the Tutte polynomialFourientations and the Tutte polynomialCounting acyclic digraphs by sources and sinksEdge-rooted forests and the \(\alpha\)-invariant of cone graphsOn maximum graphs in Tutte polynomial posetsParking functions: from combinatorics to probabilityCounting acyclic and strong digraphs by descentsOn some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomialsGenerating functions of some families of directed uniform hypergraphsExact formulas for moments of sums of classical parking functions\(G\)-parking functions and tree inversionsTriangulations of Cayley and Tutte polytopesPartial graph orientations and the Tutte polynomialRiemann-Roch theory for graph orientationsTutte polynomials for directed graphsUnnamed ItemUnnamed ItemPermutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary treesParking functions, valet functions and priority queuesAn algorithm for the Tutte polynomials of graphs of bounded treewidthSyzygies of oriented matroids




This page was built for publication: The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions