We gave a new criterion for graphical partitions. We derive a new recursion formula, which allows the computation of the number g(n) of graphical partitions of weight n for up to n > 900.
CITATION STYLE
Kohnert, A. (2004). Dominance order and graphical partitions. Electronic Journal of Combinatorics, 11(1 N). https://doi.org/10.37236/1845
Mendeley helps you to discover research relevant for your work.