DeepAI AI Chat
Log In Sign Up

On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path

by   Olivier Hudry, et al.
Télécom Paris
Laboratoire de Recherche en Informatique (LRI)

The decision problems of the existence of a Hamiltonian cycle or of a Hamiltonian path in a given graph, and of the existence of a truth assignment satisfying a given Boolean formula C, are well-known NP-complete problems. Here we study the problems of the uniqueness of a Hamiltonian cycle or path in an undirected, directed or oriented graph, and show that they have the same complexity, up to polynomials, as the problem U-SAT of the uniqueness of an assignment satisfying C. As a consequence, these Hamiltonian problems are NP-hard and belong to the class DP, like U-SAT.


page 1

page 2

page 3

page 4


An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem

The Hamiltonian cycle problem (HCP) is an important combinatorial proble...

Planar 3-SAT with a Clause/Variable Cycle

In a Planar 3-SAT problem, we are given a 3-SAT formula together with it...

SFCM-R: A novel algorithm for the hamiltonian sequence problem

A hamiltonian sequence is a path walk P that can be a hamiltonian path o...

On the Hardness of Problems Involving Negator Relationships in an Artificial Hormone System

The Artificial Hormone System (AHS) is a self-organizing middleware to a...

Alternating Hamiltonian cycles in 2-edge-colored multigraphs

A path (cycle) in a c-edge-colored multigraph is alternating if no two c...