- Volume 56 Issue 2
This paper gives for every positive integer n an explicit construction of a graph G with fewer than
graph coloring;integer factorization
- M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P, Ann. Mathematics, 160, (2004), 781-793. https://doi.org/10.4007/annals.2004.160.781
- T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley Interscience, 1995.
- M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, 1979.
- A. K. Lenstra, Integer Factoring, Designs, Codes and Cryptography, 19 (2000), 101-128. https://doi.org/10.1023/A:1008397921377
Supported by : Kyungpook National University