Taiwanese Journal of Mathematics


V. Ejov, J. A. Filar, S. K. Lucas, and J. L. Nelson

Full-text: Open access


In this note we show how the Hamiltonian Cycle problem can be reduced to solving a system of polynomial equations related to the adjacency matrix of a graph. This system of equations can be solved using the method of Gröbner bases, but we also show how a symbolic determinant related to the adjacency matrix can be used to directly decide whether a graph has a Hamiltonian cycle.

Article information

Taiwanese J. Math., Volume 10, Number 2 (2006), 327-338.

First available in Project Euclid: 18 July 2017

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier

Primary: 05C45: Eulerian and Hamiltonian graphs 13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) 68W30: Symbolic computation and algebraic computation [See also 11Yxx, 12Y05, 13Pxx, 14Qxx, 16Z05, 17-08, 33F10] 68R10: Graph theory (including graph drawing) [See also 05Cxx, 90B10, 90B35, 90C35]

Hamiltonian cycle Gröbner bases symbolic algebra


Ejov, V.; Filar, J. A.; Lucas, S. K.; Nelson, J. L. SOLVING THE HAMILTONIAN CYCLE PROBLEM USING SYMBOLIC DETERMINANTS. Taiwanese J. Math. 10 (2006), no. 2, 327--338. doi:10.11650/twjm/1500403828. https://projecteuclid.org/euclid.twjm/1500403828

Export citation


  • [1.] T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to algorithms, MIT Press, Cambridge MA, 1996.
  • [2.] D. Cox, J. Little and D. O'Shea, Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra, 2nd edition, Springer, New York, 1997.
  • [3.] V. Ejov, J.A. Filar and J. Thredgold, Geometric interpretation of Hamiltonian cycles problem via singularly perturbed Markov decision processes, Optimization, 52 (2003), 441-468.
  • [4.] E. Feinberg, Constrained discounted Markov decision process with Hamiltonian cycles, Mathematics of Operations Research, 25 (2000), 130-140.
  • [5.] D. S. Johnson and C. H. Papadimitriou, The travelling salesman problem: a guided tour of combinatorial optimization, ch. Computational Compexity, 37-85, John Wiley & Sons Ltd., New York, 1985.
  • [6.] M. Kreuzer and L. Robbiano, Computational commutative algebra 1, Springer, New York, 2000.
  • [7.] E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley Series in Discrete Mathematics & Optimization, John Wiley and Sons, New York, 1985.
  • [8.] A. D. Plotnikov, A logical model of HCP, Int. J. Math. Math. Sci., 26 (2001), 679-684.
  • [9.] B. Vandegriend, Finding Hamiltonian cycles: algorithms, graphs and performance, Master of Science, Department of Computing Science, University of Alberta 1998.
  • [10.] R. S. Varga, Matrix iterative analysis, Prentice-Hall Inc., Englewood Cliffs, NJ, 1962.