The complexity for partitioning graphs by monochromatic trees, cycles and paths

International Journal of Computer Mathematics

Volumn 81, Issue 11, 2004, Pages 1357-1362

  Jin, Zemin ^a   Xueliang, L I ^a  

^a NANKAI UNIVERSITY   (China)

Author keywords

Combinatorial problems; Computational complexity; Cycle and path; Monochromatic; Tree; Vertex disjoint

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; PROBLEM SOLVING; TREES (MATHEMATICS);

COMBINATORIAL PROBLEMS; CYCLE AND PATH; MONOCHROMATIC; VERTEX DISJOINT;

COMPUTATIONAL COMPLEXITY;

EID: 28244466712     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207160412331290685     Document Type: Article

References (17)

1. Brandstadt, A. (1996). Partitions of graphs into one or two independent sets and cliques. Discrete Math., 152, 47-54.
2. Enomoto, H. (2001). Graph partition problems into cycles and paths. Discrete Math., 233, 93-101.
3. Feder, T. and Motwani, R. (1995). Clique partitions, graph compression and speeding-up algorithms. J. Comput. Syst. Sci., 51, 261-272.
4. Garey, M. R. and Johnson, D. S. (1979). Computers and Intractability. W.H. Freeman, San Francisco.
5. Holyer, L. (1981). The NP-completeness of some edge-partition problems. SIAM J. Comput., 10, 713-717.
6. MacGillivray, G. and Yu, M. L. (1999). Generalized partitions of graphs. Discrete Appl. Math., 91, 143-153.
7. Feder, T., Hell, P., Klein, S. and Motwani, R. Complexity of graph partition problems. Proceedings ofThirty-First Annual ACM Symposium on Theory of Computing, STOC'99, 464-412.
8. Gyárfás, A. (1983). Vertex coverings by monochromatic paths and cycles. J. Graph Theory, 7, 131-135.
9. Erdös, P., Gyárfás, A. and Pyber, L. (1991). Vertex coverings by monochromatic cycles and trees. J. Comb. Theory Ser. B, 51, 90-95.
10. Maxell, P. E. and Kohayakawa, Y. (1996). Partitioning by monochromatic trees. J. Comb. Theory Ser. B, 68, 218-222.
11. Haxell, P. E. (1997). Partitioning complete bipartite graphs by monochromatic cycles. J. Comb. Theory Ser: B, 69, 210-218.
12. Kaneko, A., Kano, M. and Suzuki, K. Partitioning complete multipartite graphs by monochromatic trees, personal communication.
13. Broersma, H. J. and Li, X. (1997). Spanning trees with many or few colours in edge-coloured graph. Discuss. Math. Graph Theory, 17(2), 259-269.
14. Chang, R. and Leu, S. (1997). The minimum labeling spanning trees. Info. Process. Lett., 63, 277-282.
15. Lawler, E. L. (1976). Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York.
16. Feige, U. (1998). A threshold of In n for approximating set cover. J. A CM, 45, 634-652.
17. Hochbaum, D. S. (Ed.) (1997). Approximation Algorithm for N P-Hard Problems. PWS Publishing Company, Boston, MA.