Registro:

Referencias:

• Aardal, K.I., Hipolito, A., Van Hoesel, C.P.M., Jansen, B., (1996) A Branch-and-cut Algorithm for the Frequency Assignment Problem, , Tech. Report, Maastricht University
• Bahiense, L., Frota, Y., MacUlan, N., Noronha, T., Ribeiro, C., A branch-and-cut algorithm for equitable coloring based on a formulation by representatives (2009) Electron. Notes Discrete Math., 35, pp. 347-352
• Bahiense, L., Frota, Y., Noronha, T., Ribeiro, C., A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (2011) Discrete Appl. Math., , http://dx.doi.org/10.1016/j.dam.2011.10.008, in press
• Campêlo, M., Corrêa, R., Campos, V., On the asymmetric representatives formulation for the vertex coloring problem (2008) Discrete Appl. Math., 156, pp. 1097-1111
• Chen, B., Huang, K., On the equitable colorings of Kneser graphs (2009) India-Taiwan Conference on Discrete Mathematics, , NTU
• Das, S.K., Finocchi, I., Petreschi, R., Conflict-free star-access in parallel memory systems (2006) J. Parallel Distrib. Comput., 66, pp. 1431-1441
• http://mat.gsia.cmu.edu/COLOR/instances.html, DIMACS COLORLIB library; Januschowski, T., Pfetsch, M., The maximum k-colorable subgraph problem and orbitopes (2011) Discrete Optim., 8, pp. 478-494
• Kaibel, V., Pfetsch, M., Packing and partitioning orbitopes (2008) Math. Program., 114, pp. 1-36
• Kierstead, H.A., Kostochka, A.V., A short proof of the Hajnal-Szemerédi Theorem on equitable coloring (2008) Combin. Probab. Comput., 17, pp. 265-270
• Kubale, M., (2004) Graph Colorings, , American Mathematical Society Providence, Rhode Island
• Lih, K.-W., Chen, B.-L., Equitable coloring of trees (1994) J. Combin. Theory Ser. B, 61, pp. 83-87
• Margot, F., Symmetry in integer linear programming (2009) 50 Years of Integer Programming, , Springer
• Méndez-Díaz, I., A linear integer programming approach for the equitable coloring problem (2009) II Congreso de Matemática Aplicada, Computacional e Industrial, , Argentina
• Méndez-Díaz, I., Online Appendix of the Paper A Polyhedral Approach for the Equitable Coloring Problem, , http://www.fceia.unr.edu.ar/~daniel/ecopt/onlineapp.pdf
• Méndez-Díaz, I., Zabala, P., A cutting plane algorithm for graph coloring (2008) Discrete Appl. Math., 156, pp. 159-179
• Meyer, W., Equitable coloring (1973) Amer. Math. Monthly, 80, pp. 920-922
• Pemmaraju, S.V., Equitable colorings extend Chernoff-Hoeffding bounds (2001) Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 2129, pp. 285-296. , Lecture Notes in Comput. Sci
• Tucker, A., Perfect graphs and an application to optimizing municipal services (1973) SIAM Rev., 15, pp. 585-590

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------