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

Olivier Hudry; Antoine Lobstein

Journal Articles WSEAS Transactions on Mathematics Year : 2022

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

(1, 2, 3) ,

1
2
3

Olivier Hudry

Function : Author
PersonId : 176850
IdHAL : olivier-hudry
ORCID : 0000-0002-5132-3024

Télécom Paris

Cybersécurité et Cryptographie

Département Informatique et Réseaux

Antoine Lobstein

Function : Author
PersonId : 15262
IdHAL : antoine-lobstein
IdRef : 029411696

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Computational Complexity [cs.CC]

Olivier Hudry : Connect in order to contact the contributor

https://hal.telecom-paris.fr/hal-03700181

Submitted on : Tuesday, June 21, 2022-1:08:10 AM

Last modification on : Tuesday, February 28, 2023-3:36:25 PM

Dates and versions

hal-03700181 , version 1 (21-06-2022)

Identifiers

HAL Id : hal-03700181 , version 1

Cite

Olivier Hudry, Antoine Lobstein. On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. WSEAS Transactions on Mathematics, 2022. ⟨hal-03700181⟩

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

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share