[67] M. Caramia and P. Dell'Olmo. Bounding vertex coloring by truncated multistage branch and bound, Networks,44(4)(2004,231-242 168 M. Kubale and B. Jackowski. A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM, 28(1985), 412-418 [ 69]A. Mehrotra and M. Trick, A column generation approach for graph coloring. INFORMS Journal On Computing, 8(4)(1996), 344-354 [70]SR. Vegdahl, Using node merging to enhance graph coloring In PLD/ 99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation (1999), 150-154, ACM Press, New York, NY, USA [71]F. Herrmann and A. Hertz, Finding the chromatic number by means of critical graphs Journal of Experimental Algorithmics, 7(2002), p10 [ G.A. Kochenberger, F. Glover, B. Alidaee, and C. Rego, An unconstrained quadratic binary approach to the vertex coloring problem. Annals ofoperations Research, 139(1)(2005), 229-241 [73 A. Wigderaon, improving the performance guarantee for approximate graph coloring, Journal of the ACa,30(1983),729-735 174] B. Berger and J. Rompel. a better permance guarantee for approximate graph coloring Algorithmica, 5(1990), 459-466 75]M. M. Halldorsson, A still better performance guarantee for approximate graph coloring, Processing Letters, 45(1993),19-23 [76] M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and non-approximabil ity -towards tight results, SIAMJ. Comp. 27(1998),804-915 [77]A Blum, and D Karger, An O(n)-coloring algorithm for 3-colorable graphs, Information Processing Letters, 61(1997), 49-53 78]L. J. Cowen, W. Goddard, and C. E. Jesurum, Coloring with defect, Proc. &th Ann ACM-SIAM Symp. on Discrete AlgorithmS, ACM-SIAM, (1997), 548-557 [79]R. Duh, and M. Furer, Approximation of k-set cover by semi-local optimization, Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM, (1997), 256-265 80 D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, J. ACM, 45(1998), 246-265. E n Proceedings of the 35AnnuaI IEEE Symposium on Foundations of Computer Science, (1994), 2-13 81] Crivelevich, and B. Sudakov, Appr oximate coloring of uniform hypergraphs, Proc. 6th Ann. European Symp. on Algorithms, Lecture Notes in Comput. Sci., Springer-Verlag, (1998), 477-489 [82] T. Hofmeister, and H. Lefmann, Approximating maximum independent sets in uniform hypergraphs, Proc. 23rd International Symp. on Mathematical Foundations of Comput. Sci Lecture Notes in Comput. Sci. 1450, Springer-Verlag, (1998), 562-570 [83]U. Feige, and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57(2)(1998),187-199 84]V. Kumar, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, Proc. Ist Int. Workshop on Approximation Algorithms for Combinatorial Problems ecture Notes in Comput. Sci., Springer-Verlag, (1998), 147-1587 [67] M. Caramia and P. Dell'Olmo. Bounding vertex coloring by truncated multistage branch and bound, Networks, 44(4) (2004), 231-242. [68] M. Kubale and B. Jackowski. A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM, 28 (1985), 412-418. [69] A. Mehrotra and M. Trick, A column generation approach for graph coloring. INFORMS Journal On Computing, 8(4) (1996), 344-354. [70] S.R. Vegdahl, Using node merging to enhance graph coloring. In PLDI '99: Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, (1999), 150-154, ACM Press, New York, NY, USA. [71] F. Herrmann and A. Hertz, Finding the chromatic number by means of critical graphs. Journal of Experimental Algorithmics, 7(2002), p10. [72] G.A. Kochenberger, F. Glover, B. Alidaee, and C. Rego, An unconstrained quadratic binary approach to the vertex coloring problem. Annals of Operations Research, 139(1) (2005), 229-241. [73] A. Wigderaon, improving the performance guarantee for approximate graph coloring, Journal of the ACM, 30(1983), 729-735. [74] B. Berger and J. Rompel. A better permance guarantee for approximate graph coloring. Algorithmica, 5(1990), 459-466. [75] M. M. Halldórsson, A still better performance guarantee for approximate graph coloring, Information Processing Letters，45(1993), 19-23. [76] M. Bellare, O. Goldreich, and M. Sudan, Free bits, PCPs and non-approximability - towards tight results, SIAM J. Comp. 27(1998), 804-915. [77] A. Blum, and D. Karger, An 3 14 O n( )  -coloring algorithm for 3-colorable graphs, Information Processing Letters，61(1997), 49-53. [78] L. J. Cowen, W. Goddard, and C. E. Jesurum, Coloring with defect, Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, (1997), 548-557. [79] R. Duh, and M. Fürer, Approximation of k-set cover by semi-local optimization, Proc. 29th Ann. ACM Symp. on Theory of Comp., ACM, (1997), 256-265. [80] D. Karger, R. Motwani, and M. Sudan, Approximate graph coloring by semidefinite programming, J. ACM，45(1998), 246-265. 或见 Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, (1994), 2-13. [81] M. Krivelevich, and B. Sudakov, Approximate coloring of uniform hypergraphs, Proc. 6th Ann. European Symp. on Algorithms, Lecture Notes in Comput. Sci., Springer-Verlag, (1998), 477-489. [82] T. Hofmeister, and H. Lefmann, Approximating maximum independent sets in uniform hypergraphs, Proc. 23rd International Symp. on Mathematical Foundations of Comput. Sci., Lecture Notes in Comput. Sci. 1450, Springer-Verlag, (1998), 562-570. [83] U. Feige, and J. Kilian, Zero knowledge and the chromatic number, Journal of Computer and System Sciences, 57(2)(1998), 187-199. [84] V. Kumar, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, Proc. 1st Int. Workshop on Approximation Algorithms for Combinatorial Problems, Lecture Notes in Comput. Sci., Springer-Verlag, (1998), 147-158