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]

Authors

Zhong Huang

This author has not been identified. Look up 'Zhong Huang' in Google

Xueliang Li

This author has not been identified. Look up 'Xueliang Li' in Google