Optimization problems over unit-distance representations of graphs

Electronic Journal of Combinatorics

Volumn 20, Issue 1, 2013, Pages

  de Carli Silva, Marcel K ^a   Tunçel, Levent ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84874444428     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/3128     Document Type: Article

References (22)

1. Y. Bilu. Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number. J. Combin. Theory Ser. B, 96(4):608-613, 2006.
2. P. J. Cameron, A. Montanaro, M. W. Newman, S. Severini, and A. Winter. On the quantum chromatic number of a graph. Electron. J. Combin., 14(1):Research Paper 81, 15 pp. (electronic), 2007.
3. F. R. K. Chung. Spectral graph theory, Volume 92 of CBMS Regional Conference Series in Mathematics. Published for the Conference Board of the Mathematical Sciences, Washington, DC, 1997.
4. P. Erdos, F. Harary, and W. T. Tutte. On the dimension of a graph. Mathematika, 12:118-122, 1965.
5. A. Galtman. Spectral characterizations of the Lovász number and the Delsarte number of a graph. J. Algebraic Combin., 12(2):131-143, 2000.
6. D. Gijswijt. Matrix Algebras and Semidefinite Programming Techniques for Codes. PhD thesis, University of Amsterdam, 2005.
7. M. X. Goemans. Semidefinite programming in combinatorial optimization. Math. Programming, 79 (1-3, Ser. B):143-161, 1997. Lectures on mathematical programming (ismp97) (Lausanne, 1997).
8. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization, volume 2 of Algorithms and Combinatorics. Springer-Verlag, Berlin, second edition, 1993.
9. H. van der Holst, M. Laurent, and A. Schrijver. On a minor-monotone graph invariant. J. Combin. Theory Ser. B, 65(2):291-304, 1995.
10. B. Horvat, J. Kratochvíl, and T. Pisanski. On the computational complexity of degenerate unit distance representations of graphs. In Combinatorial algorithms, volume 6460 of Lecture Notes in Comput. Sci., pages 274-285. Springer, Heidelberg, 2011.
11. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. J. ACM, 45(2):246-265, 1998.
12. D. E. Knuth. The sandwich theorem. Electron. J. Combin., 1:Article 1, approx. 48 pp. (electronic), 1994.
13. M. Laurent and F. Rendl. Semidefinite programming and integer programming. In Handbook on Discrete Optimization, pages 393-514. Elsevier B. V., Amsterdam, 2005.
14. L. Lovász. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory, 25(1):1-7, 1979.
15. L. Lovász. Semidefinite programs and combinatorial optimization. In Recent advances in algorithms and combinatorics, pages 137-194. Springer, New York, 2003.
16. L. Lovász and M. D. Plummer. Matching theory, volume 121 ol North-Holland Mathematics Studies. North-Holland Publishing Co., Amsterdam, 1986. Annals of Discrete Mathematics, 29.
17. R. J. McEliece, E. R. Rodemich, and H. C. Rumsey, Jr. The Lovász bound and some generalizations. J. Combin. Inform. System Sci., 3(3):134-152, 1978.
18. P. Meurdesoif. Strengthening the Lovász θ(Ḡ) bound for graph coloring. Math. Program., 102(3, Ser. A):577-588, 2005.
19. J. B. Saxe. Two papers on graph embedding problems. Technical Report CMU-CS-80-102, Department of Computer Science, Carnegie-Mellon University, 1980.
20. A. Schrijver. A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inform. Theory, 25(4):425-429, 1979.
21. A. Soifer. The mathematical coloring book. Springer, New York, 2009. Mathematics of coloring and the colorful life of its creators, With forewords by Branko Grünbaum, Peter D. Johnson, Jr. and Cecil Rousseau.
22. M. Szegedy. A note on the theta number of Lovász and the generalized Delsarte bound. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science, 1994.