1. Chen, L., Li, X., Liu, M.Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph Util. Math. 86, 335-340 (2011) 2. Chen, L., Li, X., Shi, Y.The complexity of determining the rainbow vertex-connection of graphsTheoret. Comput. Sci. 412, 4531-4535 (2011)
3. Chen, L., Li, X., Lian, H.Nordhaus-Gaddum-type theorem for rainbow connection number of graphsGraphs Combin. 29, 1235-1247 (2013) 4. Chen, L., Li, X., Lian, H., Further hardness results on the rainbow vertex-connection number of graphsTheoret. Comput. Sci. 481, 18-23 (2013)
5. Chen, L., Huo, B., Ma, Y., Hardness results for total rainbow connection of graphs, Discussiones Mathematicae Graph Theory 36, 355-362 (2016)
|