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.
Zhong Huang, Xueliang Li. Hardness results for three kinds of colored connections of graphs. Theoretical Computer Science, 841:27-38, 2020. [doi]
No references recorded for this publication.
No citations of this publication recorded.