Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Ferenc Bencs, Péter Csikvári. Upper bound for the number of spanning forests of regular graphs. Eur. J. Comb., 110:103677, May 2023. [doi]
No references recorded for this publication.
No citations of this publication recorded.