<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01680709</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T11:31:52+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path</title>
            <author role="aut">
              <persName>
                <forename type="first">Olivier</forename>
                <surname>Hudry</surname>
              </persName>
              <email type="md5">80392bad49a238f2e587dafb5237f59d</email>
              <email type="domain">enst.fr</email>
              <idno type="idhal" notation="string">olivier-hudry</idno>
              <idno type="idhal" notation="numeric">176850</idno>
              <idno type="halauthorid" notation="string">1564-176850</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5132-3024</idno>
              <affiliation ref="#struct-300362"/>
              <affiliation ref="#struct-1081156"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Antoine</forename>
                <surname>Lobstein</surname>
              </persName>
              <email type="md5">59d021e287ce3bd08473a891e64499f1</email>
              <email type="domain">lri.fr</email>
              <idno type="idhal" notation="string">antoine-lobstein</idno>
              <idno type="idhal" notation="numeric">15262</idno>
              <idno type="halauthorid" notation="string">6967-15262</idno>
              <idno type="IDREF">https://www.idref.fr/029411696</idno>
              <affiliation ref="#struct-1062147"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Antoine</forename>
                <surname>Lobstein</surname>
              </persName>
              <email type="md5">59d021e287ce3bd08473a891e64499f1</email>
              <email type="domain">lri.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2020-11-30 15:20:31</date>
              <date type="whenModified">2026-02-07 05:20:24</date>
              <date type="whenReleased">2020-12-04 10:48:51</date>
              <date type="whenProduced">2022</date>
              <date type="whenEndEmbargoed">2020-11-30</date>
              <ref type="file" target="https://hal.science/hal-01680709v1/document">
                <date notBefore="2020-11-30"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01680709v1/file/OH-AL-JCMCC-unique-Ham.pdf" id="file-3031595-2669794">
                <date notBefore="2020-11-30"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="553344">
                <persName>
                  <forename>Antoine</forename>
                  <surname>Lobstein</surname>
                </persName>
                <email type="md5">59d021e287ce3bd08473a891e64499f1</email>
                <email type="domain">lri.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01680709</idno>
            <idno type="halUri">https://hal.science/hal-01680709</idno>
            <idno type="halBibtex">hudry:hal-01680709</idno>
            <idno type="halRefHtml">&lt;i&gt;WSEAS Transactions on Mathematics&lt;/i&gt;, 2022, 21, pp.433-446. &lt;a target="_blank" href="https://dx.doi.org/10.37394/23206.2022.21.51"&gt;&amp;#x27E8;10.37394/23206.2022.21.51&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">WSEAS Transactions on Mathematics, 2022, 21, pp.433-446. &amp;#x27E8;10.37394/23206.2022.21.51&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3031595-2669794"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="ENST">Ecole Nationale Supérieure des Télécommunications</idno>
            <idno type="stamp" n="TELECOM-PARISTECH" corresp="PARISTECH">Télécom Paris</idno>
            <idno type="stamp" n="PARISTECH">ParisTech</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="LTCI" corresp="TELECOM-PARISTECH">Laboratoire Traitement et Communication de l'Information</idno>
            <idno type="stamp" n="INFRES" corresp="TELECOM-PARISTECH">Département Informatique et Réseaux</idno>
            <idno type="stamp" n="MC2" corresp="TELECOM-PARISTECH">Equipe Mathématiques discrètes, codage et cryptographie</idno>
            <idno type="stamp" n="IP_PARIS">Institut Polytechnique de Paris</idno>
            <idno type="stamp" n="INSTITUTS-TELECOM">composantes instituts telecom </idno>
            <idno type="stamp" n="UNIVERSITE-PARIS-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="LISN">Laboratoire Interdisciplinaire des Sciences du Numérique</idno>
            <idno type="stamp" n="GS-ENGINEERING">Graduate School Sciences de l'Ingénierie et des Systèmes</idno>
            <idno type="stamp" n="GS-COMPUTER-SCIENCE">Graduate School Computer Science</idno>
            <idno type="stamp" n="LISN-GALAC" corresp="LISN">Graphes, Algorithmes et Combinatoire </idno>
            <idno type="stamp" n="C2" corresp="TELECOM-PARISTECH">Equipe Cybersécurité et Cryptographie </idno>
            <idno type="stamp" n="INSTITUT-MINES-TELECOM">Institut Mines Telecom</idno>
            <idno type="stamp" n="IP-PARIS-DEPARTEMENT-MATHEMATIQUES">Département de Mathèmatiques</idno>
            <idno type="stamp" n="IP-PARIS-MATHEMATIQUES">IP Paris Département de Mathématiques</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATION-COMMUNICATION-ELECTRONIQUE">IP Paris Département d'Information, de Communication et d'Électronique</idno>
            <idno type="stamp" n="IP-PARIS-INFORMATIQUE-DONNEES-ET-IA">IP Paris Département d'Informatique, de Données et d'IA</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Olivier</forename>
                    <surname>Hudry</surname>
                  </persName>
                  <email type="md5">80392bad49a238f2e587dafb5237f59d</email>
                  <email type="domain">enst.fr</email>
                  <idno type="idhal" notation="string">olivier-hudry</idno>
                  <idno type="idhal" notation="numeric">176850</idno>
                  <idno type="halauthorid" notation="string">1564-176850</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5132-3024</idno>
                  <affiliation ref="#struct-300362"/>
                  <affiliation ref="#struct-1081156"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Antoine</forename>
                    <surname>Lobstein</surname>
                  </persName>
                  <email type="md5">59d021e287ce3bd08473a891e64499f1</email>
                  <email type="domain">lri.fr</email>
                  <idno type="idhal" notation="string">antoine-lobstein</idno>
                  <idno type="idhal" notation="numeric">15262</idno>
                  <idno type="halauthorid" notation="string">6967-15262</idno>
                  <idno type="IDREF">https://www.idref.fr/029411696</idno>
                  <affiliation ref="#struct-1062147"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">48167</idno>
                <idno type="issn">1109-2769</idno>
                <idno type="eissn">2224-2880</idno>
                <title level="j">WSEAS Transactions on Mathematics</title>
                <imprint>
                  <publisher>World Scientific and Engineering Academy and Society (WSEAS)</publisher>
                  <biblScope unit="volume">21</biblScope>
                  <biblScope unit="pp">433-446</biblScope>
                  <date type="datePub">2022</date>
                </imprint>
              </monogr>
              <idno type="doi">10.37394/23206.2022.21.51</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Graph Theory</term>
                <term xml:lang="en">Hamiltonian Cycle</term>
                <term xml:lang="en">Hamiltonian Path</term>
                <term xml:lang="en">Travelling Salesman</term>
                <term xml:lang="en">Complexity Theory</term>
                <term xml:lang="en">NP-Hardness</term>
                <term xml:lang="en">Decision Problems</term>
                <term xml:lang="en">Polynomial Reduction</term>
                <term xml:lang="en">Uniqueness of Solution</term>
                <term xml:lang="en">Boolean Satisfiability Problems</term>
              </keywords>
              <classCode scheme="halDomain" n="math">Mathematics [math]</classCode>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>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 NPcomplete 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.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-300362" status="VALID">
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom ParisTech</orgName>
          <date type="start">2008-01-01</date>
          <date type="end">2019-06-11</date>
          <desc>
            <address>
              <addrLine>46 rue Barrault 75634 Paris Cedex 13</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-1081156" status="VALID">
          <orgName>Cybersécurité et Cryptographie</orgName>
          <orgName type="acronym">C2</orgName>
          <date type="start">2021-10-07</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU. Fusion de: CCN, Cybersecurity for Communication and Networking et de MC2, Mathématiques discrètes, Codage et Cryptographie</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci/les-equipes-de-recherche/cybersecurite-cryptographie-c2</ref>
          </desc>
          <listRelation>
            <relation name="484335" active="#struct-484335" type="direct"/>
            <relation active="#struct-302102" type="indirect"/>
            <relation active="#struct-1048346" type="indirect"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-1062147" status="VALID">
          <orgName>Graphes, Algorithmes et Combinatoire - LISN</orgName>
          <orgName type="acronym">GALaC</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Université Paris-Saclay, Bâtiment 650, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1061259" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9015" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1065373" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-484335" status="VALID">
          <idno type="IdRef">162384270</idno>
          <idno type="ISNI">0000 0000 9194 9502</idno>
          <idno type="RNSR">200319327Z</idno>
          <idno type="ROR">https://ror.org/057er4c39</idno>
          <orgName>Laboratoire Traitement et Communication de l'Information</orgName>
          <orgName type="acronym">LTCI</orgName>
          <date type="start">2017-01-01</date>
          <desc>
            <address>
              <addrLine>Télécom Paris 19 Place Marguerite Perey 91120 PALAISEAU</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr/fr/recherche/laboratoires/laboratoire-traitement-et-communication-de-linformation-ltci</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-1048346" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-302102" status="VALID">
          <idno type="IdRef">192427156</idno>
          <idno type="ISNI">000000012202567X</idno>
          <idno type="ROR">https://ror.org/025vp2923</idno>
          <idno type="Wikidata">Q27962533</idno>
          <orgName>Institut Mines-Télécom [Paris]</orgName>
          <orgName type="acronym">IMT</orgName>
          <date type="start">2012-03-01</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.imt.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-1048346" status="VALID">
          <idno type="IdRef">026375273</idno>
          <idno type="ISNI">0000 0001 2108 2779</idno>
          <idno type="ROR">https://ror.org/01naq7912</idno>
          <orgName>Télécom Paris</orgName>
          <date type="start">2019-06-12</date>
          <desc>
            <address>
              <addrLine>19 Place Marguerite Perey 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.telecom-paris.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-302102" type="direct"/>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1061259" status="VALID">
          <idno type="IdRef">253160316</idno>
          <idno type="RNSR">202123711L</idno>
          <idno type="ROR">https://ror.org/00rd81916</idno>
          <idno type="Wikidata">Q109620676</idno>
          <orgName>Laboratoire Interdisciplinaire des Sciences du Numérique</orgName>
          <orgName type="acronym">LISN</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Universitaire bât 507Rue du Belvédère91405 Orsay cedexet Campus Universitaire bât 6401 rue Raimond Castaing91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lisn.upsaclay.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-419361" type="direct"/>
            <relation name="UMR9015" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-419361" status="VALID">
          <idno type="IdRef">241345251</idno>
          <idno type="ROR">https://ror.org/03xjwb503</idno>
          <orgName>Université Paris-Saclay</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment Bréguet, 3 Rue Joliot Curie 2e ét, 91190 Gif-sur-Yvette</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.universite-paris-saclay.fr/fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-1065373" status="VALID">
          <orgName>Algorithmes, Apprentissage et Calcul</orgName>
          <orgName type="acronym">AAC</orgName>
          <date type="start">2021-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-1061259" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-419361" type="indirect"/>
            <relation name="UMR9015" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>