External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem

Udi Manber, Martin Tompa. The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem. In 22nd Annual Symposium on Foundations of Computer Science, 28-30 October 1981, Nashville, Tennessee, USA. pages 220-227, IEEE, 1981.

Abstract

Abstract is missing.

runs on