Edge coloring of graphs, uses, limitation, complexity

References

[1] I. M. Bomze, M. Budinich, P. M. Pardalos, M. Pelillo, The Maximum Clique Problem, Handbook of Combinatorial Optimization Vol. 4, Kluwer Academic Publisher, 1999. ⇒6410.1007/978-1-4757-3023-4_1
Search in Google Scholar
[2] R. Carraghan, P. M. Pardalos, An exact algorithm for the maximum clique problem, Operation Research Letters9 (1990), 375–382. ⇒67
Search in Google Scholar
[3] J. Hasselberg, P. M. Pardalos, and G. Vairaktarakis, Test case generators and computational results for the maximum clique problem, Journal of Global Optimization3 (1993), 463–482. ⇒64
Search in Google Scholar
[4] D. Kumlander, Some Practical Algorithms to Solve the Maximal Clique problem PhD. Thesis, Tallin University of Technology, 2005. ⇒64
Search in Google Scholar
[5] C. Morgan, A Combinatorial Search with Dancing Links, PhD. Thesis, Univ. of Warwick, 1999–2000. ⇒64
Search in Google Scholar
[6] J. Mycielski, Sur le coloriage des graphes, Colloq. Math.3 (1955), 161–162. ⇒70
Search in Google Scholar
[7] C. H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company, Inc., 1994. ⇒64, 74
Search in Google Scholar
[8] S. Szabó, Parallel algorithms for finding cliques in a graph, Journal of Physics: Conference Series268 (2011) 012030 ⇒63, 65
Search in Google Scholar