Zemin Jin, Xueliang Li. The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math., 81(11):1357-1362, 2004. [doi]
@article{JinL04:0,
title = {The complexity for partitioning graphs by monochromatic trees, cycles and paths},
author = {Zemin Jin and Xueliang Li},
year = {2004},
doi = {10.1080/00207160412331290685},
url = {http://dx.doi.org/10.1080/00207160412331290685},
tags = {graph-rewriting, rewriting, partitioning},
researchr = {https://researchr.org/publication/JinL04%3A0},
cites = {0},
citedby = {0},
journal = {Int. J. Comput. Math.},
volume = {81},
number = {11},
pages = {1357-1362},
}