<?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-01104634v1</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-17T07:24:24+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Eulerian and Hamiltonian dicycles in directed hypergraphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Julio</forename>
                <surname>Araujo</surname>
              </persName>
              <email type="md5">6a3486cf2270c59b35dc824a28edf949</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">912809</idno>
              <idno type="halauthorid" notation="string">449889-912809</idno>
              <affiliation ref="#struct-117182"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Claude</forename>
                <surname>Bermond</surname>
              </persName>
              <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">jean-claude-bermond</idno>
              <idno type="idhal" notation="numeric">739520</idno>
              <idno type="halauthorid" notation="string">13047-739520</idno>
              <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
              <idno type="IDREF">https://www.idref.fr/032696256</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Guillaume</forename>
                <surname>Ducoffe</surname>
              </persName>
              <email type="md5">69264a7f89bae18307527334c7be9e83</email>
              <email type="domain">ici.ro</email>
              <idno type="idhal" notation="string">guillaume-ducoffe</idno>
              <idno type="idhal" notation="numeric">18317</idno>
              <idno type="halauthorid" notation="string">23686-18317</idno>
              <idno type="IDREF">https://www.idref.fr/199227896</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Guillaume</forename>
                <surname>Ducoffe</surname>
              </persName>
              <email type="md5">69264a7f89bae18307527334c7be9e83</email>
              <email type="domain">ici.ro</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-01-18 17:45:52</date>
              <date type="whenModified">2026-01-27 16:58:02</date>
              <date type="whenReleased">2015-01-19 11:11:16</date>
              <date type="whenProduced">2014</date>
              <date type="whenEndEmbargoed">2015-01-18</date>
              <ref type="file" target="https://hal.science/hal-01104634v1/document">
                <date notBefore="2015-01-18"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-01104634v1/file/dihypergraphs-dmaa.pdf" id="file-1104634-1187535">
                <date notBefore="2015-01-18"/>
              </ref>
              <ref type="externalLink" target="https://hal.archives-ouvertes.fr/hal-01104634/document/"/>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2015-02-06 15:45:15</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="172029">
                <persName>
                  <forename>Guillaume</forename>
                  <surname>Ducoffe</surname>
                </persName>
                <email type="md5">69264a7f89bae18307527334c7be9e83</email>
                <email type="domain">ici.ro</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01104634</idno>
            <idno type="halUri">https://hal.science/hal-01104634</idno>
            <idno type="halBibtex">araujo:hal-01104634</idno>
            <idno type="halRefHtml">&lt;i&gt;Discrete Mathematics, Algorithms and Applications&lt;/i&gt;, 2014, 06, pp.1450012. &lt;a target="_blank" href="https://dx.doi.org/10.1142/S1793830914500128"&gt;&amp;#x27E8;10.1142/S1793830914500128&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discrete Mathematics, Algorithms and Applications, 2014, 06, pp.1450012. &amp;#x27E8;10.1142/S1793830914500128&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1104634-1187535"/></licence>
            </availability>
          </publicationStmt>
          <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">Eulerian and Hamiltonian dicycles in directed hypergraphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Julio</forename>
                    <surname>Araujo</surname>
                  </persName>
                  <email type="md5">6a3486cf2270c59b35dc824a28edf949</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">912809</idno>
                  <idno type="halauthorid" notation="string">449889-912809</idno>
                  <affiliation ref="#struct-117182"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Claude</forename>
                    <surname>Bermond</surname>
                  </persName>
                  <email type="md5">6152b43c5dee4ff74e213a261cfe369d</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">jean-claude-bermond</idno>
                  <idno type="idhal" notation="numeric">739520</idno>
                  <idno type="halauthorid" notation="string">13047-739520</idno>
                  <idno type="ORCID">https://orcid.org/0009-0001-0454-0050</idno>
                  <idno type="IDREF">https://www.idref.fr/032696256</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Guillaume</forename>
                    <surname>Ducoffe</surname>
                  </persName>
                  <email type="md5">69264a7f89bae18307527334c7be9e83</email>
                  <email type="domain">ici.ro</email>
                  <idno type="idhal" notation="string">guillaume-ducoffe</idno>
                  <idno type="idhal" notation="numeric">18317</idno>
                  <idno type="halauthorid" notation="string">23686-18317</idno>
                  <idno type="IDREF">https://www.idref.fr/199227896</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">70872</idno>
                <idno type="issn">1793-8309</idno>
                <title level="j">Discrete Mathematics, Algorithms and Applications</title>
                <imprint>
                  <publisher>World Scientific Publishing</publisher>
                  <biblScope unit="volume">06</biblScope>
                  <biblScope unit="pp">1450012</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1142/S1793830914500128</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Directed hypergraphs</term>
                <term xml:lang="en">Eulerian and Hamiltonian dicycles</term>
                <term xml:lang="en">de Bruijn dihyper-graphs Mathematics Subject Classification 2000: 11xxx</term>
                <term xml:lang="en">11xxx</term>
              </keywords>
              <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>In this article, we generalize the concepts of Eulerian and Hamiltonian digraphs to directed hypergraphs. A dihypergraph H is a pair (V(H), E(H)), where V(H) is a non-empty set of elements, called vertices, and E(H) is a collection of ordered pairs of subsets of V(H), called hyperarcs. It is Eulerian (resp. Hamiltonian) if there is a dicycle containing each hyperarc (resp. each vertex) exactly once. We first present some properties of Eulerian and Hamiltonian dihypergraphs. For example, we show that deciding whether a dihypergraph is Eulerian is an NP-complete problem. We also study when iterated line dihypergraphs are Eulerian and Hamiltonian. Finally, we study when the generalized de Bruijn dihypergraphs are Eulerian and Hamiltonian. In particular, we determine when they contain a complete Berge dicycle, i.e. an Eulerian and Hamiltonian dicycle.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-117182" status="VALID">
          <idno type="ISNI">0000 0001 2160 0329</idno>
          <idno type="ROR">https://ror.org/03srtnf24</idno>
          <orgName>Universidade Federal do Ceará = Federal University of Ceará</orgName>
          <orgName type="acronym">UFC</orgName>
          <desc>
            <address>
              <addrLine>Av. da Universidade, 2853 - Benfica, Fortaleza - CE, CEP 60020-181</addrLine>
              <country key="BR"/>
            </address>
            <ref type="url">http://www.ufc.br/</ref>
          </desc>
        </org>
        <org type="researchteam" xml:id="struct-211142" status="VALID">
          <idno type="RNSR">201322124W</idno>
          <idno type="ROR">https://ror.org/02mab7455</idno>
          <orgName>Combinatorics, Optimization and Algorithms for Telecommunications</orgName>
          <orgName type="acronym">COATI</orgName>
          <date type="start">2013-01-01</date>
          <date type="end">2026-04-30</date>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France)</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/coati</ref>
          </desc>
          <listRelation>
            <relation active="#struct-34586" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-451999" type="direct"/>
            <relation active="#struct-13009" type="indirect"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-34586" status="VALID">
          <idno type="RNSR">198318250R</idno>
          <idno type="ROR">https://ror.org/01nzkaw91</idno>
          <orgName>Centre Inria d'Université Côte d'Azur</orgName>
          <desc>
            <address>
              <addrLine>2004 route des Lucioles BP 93 06902 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/sophia/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" 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="department" xml:id="struct-451999" status="VALID">
          <orgName>COMmunications, Réseaux, systèmes Embarqués et Distribués</orgName>
          <orgName type="acronym">Laboratoire I3S - COMRED</orgName>
          <date type="start">2016-03-02</date>
          <desc>
            <address>
              <addrLine>Laboratoire I3SCS 4012106903 Sophia Antipolis Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/comred</ref>
          </desc>
          <listRelation>
            <relation active="#struct-13009" type="direct"/>
            <relation active="#struct-117617" type="indirect"/>
            <relation name="UMR7271" active="#struct-441569" type="indirect"/>
            <relation active="#struct-1039632" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-13009" status="VALID">
          <idno type="IdRef">050320491</idno>
          <idno type="ISNI">0000000105613840</idno>
          <idno type="RNSR">201220432L</idno>
          <idno type="ROR">https://ror.org/01215r597</idno>
          <orgName>Laboratoire d'Informatique, Signaux, et Systèmes de Sophia Antipolis</orgName>
          <orgName type="acronym">I3S</orgName>
          <desc>
            <address>
              <addrLine>2000, route des Lucioles - Les Algorithmes - bât. Euclide B 06900 Sophia Antipolis</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.i3s.unice.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-117617" type="direct"/>
            <relation name="UMR7271" active="#struct-441569" type="direct"/>
            <relation active="#struct-1039632" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-117617" status="VALID">
          <idno type="IdRef">026403498</idno>
          <idno type="ISNI">0000000123372892</idno>
          <idno type="ROR">https://ror.org/02k9vew78</idno>
          <orgName>Université Nice Sophia Antipolis (1965 - 2019)</orgName>
          <orgName type="acronym">UNS</orgName>
          <date type="start">1965-10-23</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 06100 Nice</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://unice.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="regroupinstitution" xml:id="struct-1039632" status="VALID">
          <idno type="IdRef">241035694</idno>
          <idno type="ROR">https://ror.org/019tgvf94</idno>
          <orgName>Université Côte d'Azur</orgName>
          <orgName type="acronym">UniCA</orgName>
          <date type="start">2020-01-01</date>
          <desc>
            <address>
              <addrLine>Parc Valrose, 28, avenue Valrose 06108 Nice Cedex 2</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://univ-cotedazur.fr</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>