Pages that link to "Item:Q405267"
From MaRDI portal
The following pages link to Order polynomials and Pólya's enumeration theorem. (Q405267):
Displaying 13 items.
- An invariant theory approach to graph enumeration (Q801080) (← links)
- The chromatic quasisymmetric class function of a digraph (Q825961) (← links)
- A recursion of the Pólya polynomial for the symmetric group (Q974255) (← links)
- Generating polynomial orderings (Q1318775) (← links)
- The odd-valued chromatic polynomial of a signed graph (Q2166295) (← links)
- (Q3145737) (← links)
- Ordered partitions and colourings of cycles and necklaces (Q4933929) (← links)
- Numerical Algorithm for Pólya Enumeration Theorem (Q5266601) (← links)
- Double posets and the antipode of QSym (Q5892446) (← links)
- Double posets and the antipode of QSym (Q5916023) (← links)
- Effective Poset Inequalities (Q6046818) (← links)
- Chromatic quasisymmetric class functions of linearized combinatorial Hopf monoids (Q6103826) (← links)
- Chromatic quasisymmetric class functions for combinatorial Hopf monoids (Q6655685) (← links)