Dominance order and graphical partitions

13Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Kohnert, A. (2004). Dominance order and graphical partitions. Electronic Journal of Combinatorics, 11(1 N). https://doi.org/10.37236/1845

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free