Pages that link to "Item:Q1918884"
From MaRDI portal
The following pages link to The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions (Q1918884):
Displaying 31 items.
- Chip-firing game and a partial Tutte polynomial for Eulerian digraphs (Q276208) (← links)
- Parking functions and tree inversions revisited (Q308986) (← links)
- On the evaluation of the Tutte polynomial at the points \((1, -1)\) and \((2, -1)\) (Q360351) (← links)
- Riemann-Roch theory for graph orientations (Q509688) (← links)
- Interval partitions and activities for the greedoid Tutte polynomial (Q679037) (← links)
- Partial graph orientations and the Tutte polynomial (Q679543) (← links)
- Edge-rooted forests and the \(\alpha\)-invariant of cone graphs (Q881589) (← links)
- On some quadratic algebras. I \(\frac{1}{2}\): Combinatorics of Dunkl and Gaudin elements, Schubert, Grothendieck, Fuss-Catalan, universal Tutte and reduced polynomials (Q903707) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
- Parking functions, valet functions and priority queues (Q1292844) (← links)
- Exact formulas for moments of sums of classical parking functions (Q1408291) (← links)
- An algorithm for the Tutte polynomials of graphs of bounded treewidth (Q1584397) (← links)
- Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions (Q1623876) (← links)
- \(G\)-parking functions and tree inversions (Q1705818) (← links)
- Syzygies of oriented matroids (Q1847895) (← links)
- Gončarov polynomials and parking functions (Q1873811) (← links)
- Enumerative applications of a decomposition for graphs and digraphs (Q1893989) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
- Generating functions of some families of directed uniform hypergraphs (Q2199871) (← links)
- Tutte polynomials for directed graphs (Q2284730) (← links)
- Permutation graphs and the abelian sandpile model, tiered trees and non-ambiguous binary trees (Q2318776) (← links)
- Fourientation activities and the Tutte polynomial (Q2408966) (← links)
- Fourientations and the Tutte polynomial (Q2408990) (← links)
- Triangulations of Cayley and Tutte polytopes (Q2437468) (← links)
- Extremal graphs for the Tutte polynomial (Q2664552) (← links)
- (Q5110947) (← links)
- (Q5110993) (← links)
- A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs (Q5300994) (← links)
- On maximum graphs in Tutte polynomial posets (Q6064837) (← links)
- Parking functions: from combinatorics to probability (Q6164864) (← links)
- Symbolic method and directed graph enumeration (Q6621253) (← links)
