JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Translating Integer Factoring into Graph Coloring
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
  • Journal title : Kyungpook mathematical journal
  • Volume 56, Issue 2,  2016, pp.611-624
  • Publisher : Department of Mathematics, Kyungpook National University
  • DOI : 10.5666/KMJ.2016.56.2.611
 Title & Authors
Translating Integer Factoring into Graph Coloring
Jensen, Tommy Rene;
  PDF(new window)
 Abstract
This paper gives for every positive integer n an explicit construction of a graph G with fewer than vertices, such that there exists a nontrivial factoring of n if and only if G is 3-colorable.
 Keywords
graph coloring;integer factorization;
 Language
English
 Cited by
 References
1.
M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P, Ann. Mathematics, 160, (2004), 781-793. crossref(new window)

2.
T. R. Jensen and B. Toft, Graph Coloring Problems, Wiley Interscience, 1995.

3.
M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, 1979.

4.
A. K. Lenstra, Integer Factoring, Designs, Codes and Cryptography, 19 (2000), 101-128. crossref(new window)