Coloring the nodes of a directed graph

[1] I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo, The maximum clique problem, in Handbook of Combinatorial Optimization Vol. 4, Eds. D.-Z. Du and P. M. Pardalos, Kluwer Academic Publisher, Boston, MA 1999. ⇒11810.1007/978-1-4757-3023-4_1Search in Google Scholar

[2] R. Carraghan, P. M. Pardalos, An exact algorithm for the maximum clique problem, Operation Research Letters 9, 6 (1990), 375-382. ⇒11810.1016/0167-6377(90)90057-CSearch in Google Scholar

[3] P. Erdős, L. Moser, On the representation of directed graphs as unions of orderings. Magyar Tud. Akad. Mat. Kutató Int. Közl. 9 (1964), 125-132. ⇒118Search in Google Scholar

[4] P. Erdős, J. W. Moon, On sets of consistent arcs in tournament, Canad. Math. Bull. 8 (1965), 269-271. ⇒11810.4153/CMB-1965-017-1Search in Google Scholar

[5] M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, New York, 2003. ⇒118Search in Google Scholar

[6] F. Kárteszi, Introduction to Finite Geometries, North-Holland Pub. Co., Amsterdam, 1976. ⇒12010.1016/B978-0-7204-2832-2.50007-5Search in Google Scholar

[7] L. Kiviluoto, P. R. J. Östergård, V. P. Vaskelainen, Exact algorithms for finding maximum transitive subtournaments, (manuscript) ⇒118Search in Google Scholar

[8] J. Konc, D. Janežič, An improved branch and bound algorithm for the maximum clique problem, MATCH Commun. Math. Comput. Chem. 58, 3 (2007), 569-590. ⇒118Search in Google Scholar

[9] D. Kumlander, Some practical algorithms to solve the maximal clique problem, PhD Thesis, Tallin University of Technology, 2005. ⇒118Search in Google Scholar

[10] J. W. Moon, Topics on Tournaments, Holt, Reinhart and Winston, New York, 1968. ⇒118Search in Google Scholar

[11] P. R. J. Östergård, A fast algorithm for the maximum clique problem, Discrete Appl. Math. 120, 1-3 (2002), 197-207. ⇒118Search in Google Scholar

[12] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., Reading, MA, 1994. ⇒118Search in Google Scholar

[13] R. Stearns, The voting problem, Amer. Math. Monthly 66 (1959), 761-763. ⇒ 11810.1080/00029890.1959.11989405Search in Google Scholar

[14] E. Tomita, T. Seki, An efficient branch-and-bound algorithm for finding a maximum clique, Discrete Mathematics and Theoretical Computer Science, Lecture Notes in Comp. Sci. 2731 (2003), 278-289. ⇒11810.1007/3-540-45066-1_22Search in Google Scholar