Pages that link to "Item:Q1893989"
From MaRDI portal
The following pages link to Enumerative applications of a decomposition for graphs and digraphs (Q1893989):
Displaying 19 items.
- Parking functions and tree inversions revisited (Q308986) (← links)
- Counting acyclic digraphs by sources and sinks (Q1126301) (← links)
- Macdonald cumulants, \(G\)-inversion polynomials and \(G\)-parking functions (Q1623876) (← links)
- \(G\)-parking functions and tree inversions (Q1705818) (← links)
- Möbius coinvariants and bipartite edge-rooted forests (Q1750218) (← links)
- LLT cumulants and graph coloring (Q2094870) (← links)
- An insertion algorithm on multiset partitions with applications to diagram algebras (Q2178556) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
- Generating functions of some families of directed uniform hypergraphs (Q2199871) (← links)
- Trees, parking functions and factorizations of full cycles (Q2225449) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- Cayley compositions, partitions, polytopes, and geometric bijections (Q2434886) (← links)
- Triangulations of Cayley and Tutte polytopes (Q2437468) (← links)
- (Q5005188) (← links)
- Trees, parking functions, and standard monomials of skeleton ideals (Q5026968) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- (Q5110993) (← links)
- Flow Polytopes and the Space of Diagonal Harmonics (Q5243499) (← links)
- Exact enumeration of satisfiable 2-SAT formulae (Q6138912) (← links)
