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.
Shude Long, Han Ren. Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number. Graphs and Combinatorics, 39(3):57, June 2023. [doi]
No references recorded for this publication.
No citations of this publication recorded.