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$.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Paper Title
Journal
Date
