On the minimum monochromatic or multicolored subgraph partition problems

Theoretical Computer Science

Volumn 385, Issue 1-3, 2007, Pages 1-10

  Li, Xueliang ^a   Zhang, Xiaoyan ^b  

^a NANKAI UNIVERSITY   (China)

^b NANJING NORMAL UNIVERSITY   (China)

Author keywords

Complexity; Inapproximability; Monochromatic; Multicolored; Partition

Indexed keywords

APPROXIMATION ALGORITHMS; COLOR; EDGE DETECTION; PROBLEM SOLVING; TREES (MATHEMATICS);

INAPPROXIMABILITY; MONOCHROMATIC CLIQUE; MULTICOLORED TREES PARTITIONING;

COMPUTER GRAPHICS;

EID: 34548673758     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.04.033     Document Type: Article

References (24)

1. Albert M., Frieze A., and Reed B. Multicolored hamilton cycles. Electron. J. Combin. 2 R10 (1995) 1-13
2. Alon N. Multicolored forests in bipartite decompositions of graphs. J. Combin. Theory Ser. B 53 (1991) 143-148
3. Alon N., Ding G., Oporowski B., and Vertigan D. Partitioning into graphs with only small components. J. Combin. Theory Ser. B 87 (2003) 231-243
4. Brandstadt A. Partitions of graphs into one or two independent sets and cliques. Discrete Math. 152 (1996) 47-54
5. Broersma H.J., Li X.L., Woeginger G., and Zhang S.G. Paths and cycles in colored graphs. Australas. J. Combin. 31 (2005) 299-311
6. Brualdi R.A., and Hollingsworth S. Multicolored trees in complete graphs. J. Combin. Theory Ser. B 68 (1996) 310-313
7. Enomoto H. Graph partition problems into cycles and paths. Discrete Math. 233 (2001) 93-101
8. Erdo{double acute}s P., Gyárfás A., and Pyber L. Vertex coverings by monochromatic cycles and trees. J. Combin. Theory Ser. B 51 (1991) 90-95
9. Erdo{double acute}s P., and Tuza Z. Rainbow subgraphs in edge-colorings of complete graphs. Ann. Discrete Math. 55 (1993) 81-88
10. Eidenbenz S., Stamm C., and Widmayer P. Positioning guards at fixed height above a terrain-an optimum inapproximability result. Proceedings of the 6th Annual European Symposium on Algorithms. Lecture Notes in Computer Science vol. 1461 (1998) 187-198
11. T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of graph partition problems, in: Proceedings of Thirty-First Annual ACM Symposium on Theory of Computing STOC'99, 1999, pp. 464-472
12. U. Feige, A threshold of ln n for approximating set cover, in: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing STOC'96, 1996, pp. 314-318
13. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman, San Francisco
14. 1 - ε{lunate}. Acta Math. 182 (1999) 105-142
15. Holyer L. The NP-completeness of some edge-partition problems. SIAM J. Comput. 10 (1981) 713-717
16. Haxell P.E., and Kohayakawa Y. Partitioning by monochromatic trees. J. Combin. Theory Ser. B 68 (1996) 218-222
17. Haxell P.E. Partitioning complete bipartite graphs by monochromatic cycles. J. Combin. Theory Ser. B 69 (1997) 210-218
18. Jin Z.M., Kano M., Li X.L., and Wei B. Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. J. Comb. Optim. 11 4 (2006) 445-454
19. Jin Z.M., and Li X.L. The complexity for partitioning graphs by monochromatic trees, cycles and paths. Int. J. Comput. Math. 81 11 (2004) 1357-1362
20. Kaneko A., Kano M., and Suzuki K. Partitioning complete multipartite graphs by monochromatic trees. J. Graph Theory 48 2 (2005) 133-141
21. Lawler E.L. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart and Winston, New York
22. MacGillivray G., and Yu M.L. Generalized partitions of graphs. Discrete Appl. Math. 91 (1999) 143-153
23. Manoussakis Y., Spyratos M., Tuza Zs., and Voigt M. Minimal colorings for properly colored subgraphs. Graphs Combin. 12 (1996) 345-360
24. Yegnanarayanan V. Graph colorings and partitions. Theoret. Comput. Sci. 263 (2001) 59-74