Hardness results for three kinds of colored connections of graphs

Zhong Huang, Xueliang Li. Hardness results for three kinds of colored connections of graphs. Theoretical Computer Science, 841:27-38, 2020. [doi]

Abstract

Abstract is missing.