<?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-03844943</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-17T05:40:47+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Spanning eulerian subdigraphs in semicomplete digraphs</title>
            <author role="aut">
              <persName>
                <forename type="first">Jørgen</forename>
                <surname>Bang-Jensen</surname>
              </persName>
              <idno type="idhal" notation="numeric">1143753</idno>
              <idno type="halauthorid" notation="string">293706-1143753</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5783-7125</idno>
              <affiliation ref="#struct-50786"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Frédéric</forename>
                <surname>Havet</surname>
              </persName>
              <email type="md5">7ad9297a403d0a4dfa0bf25d740b57aa</email>
              <email type="domain">cnrs.fr</email>
              <idno type="idhal" notation="string">frederic-havet</idno>
              <idno type="idhal" notation="numeric">9383</idno>
              <idno type="halauthorid" notation="string">20978-9383</idno>
              <idno type="IDREF">https://www.idref.fr/110354842</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-3447-8112</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anders</forename>
                <surname>Yeo</surname>
              </persName>
              <idno type="halauthorid">160815-0</idno>
              <affiliation ref="#struct-50786"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Frederic</forename>
                <surname>Havet</surname>
              </persName>
              <email type="md5">8d5c9cce21b9f8aa2b4a9cdec3368e11</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-11-09 10:28:13</date>
              <date type="whenModified">2026-02-24 08:58:02</date>
              <date type="whenReleased">2022-11-09 10:42:04</date>
              <date type="whenProduced">2022-08-24</date>
              <date type="whenEndEmbargoed">2022-11-09</date>
              <ref type="file" target="https://inria.hal.science/hal-03844943v1/document">
                <date notBefore="2022-11-09"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-03844943v1/file/supereulerian-revise.pdf" id="file-3844943-3363313">
                <date notBefore="2022-11-09"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="112474">
                <persName>
                  <forename>Frederic</forename>
                  <surname>Havet</surname>
                </persName>
                <email type="md5">8d5c9cce21b9f8aa2b4a9cdec3368e11</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03844943</idno>
            <idno type="halUri">https://inria.hal.science/hal-03844943</idno>
            <idno type="halBibtex">bangjensen:hal-03844943</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Graph Theory&lt;/i&gt;, 2022, 100 (2), pp.294-314. &lt;a target="_blank" href="https://dx.doi.org/10.1002/jgt.22779"&gt;&amp;#x27E8;10.1002/jgt.22779&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Graph Theory, 2022, 100 (2), pp.294-314. &amp;#x27E8;10.1002/jgt.22779&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3844943-3363313"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNICE">Université Nice Sophia Antipolis</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-SOPHIA">INRIA Sophia Antipolis - Méditerranée</idno>
            <idno type="stamp" n="I3S">Laboratoire d'Informatique, Signaux et Systèmes de Sophia-Antipolis</idno>
            <idno type="stamp" n="INRIASO">INRIA-SOPHIA</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</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-COTEDAZUR">Université Côte d'Azur</idno>
            <idno type="stamp" n="TEST-NICE">test nice</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">Spanning eulerian subdigraphs in semicomplete digraphs</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Jørgen</forename>
                    <surname>Bang-Jensen</surname>
                  </persName>
                  <idno type="idhal" notation="numeric">1143753</idno>
                  <idno type="halauthorid" notation="string">293706-1143753</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5783-7125</idno>
                  <affiliation ref="#struct-50786"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Frédéric</forename>
                    <surname>Havet</surname>
                  </persName>
                  <email type="md5">7ad9297a403d0a4dfa0bf25d740b57aa</email>
                  <email type="domain">cnrs.fr</email>
                  <idno type="idhal" notation="string">frederic-havet</idno>
                  <idno type="idhal" notation="numeric">9383</idno>
                  <idno type="halauthorid" notation="string">20978-9383</idno>
                  <idno type="IDREF">https://www.idref.fr/110354842</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-3447-8112</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anders</forename>
                    <surname>Yeo</surname>
                  </persName>
                  <idno type="halauthorid">160815-0</idno>
                  <affiliation ref="#struct-50786"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">13749</idno>
                <idno type="issn">0364-9024</idno>
                <idno type="eissn">1097-0118</idno>
                <title level="j">Journal of Graph Theory</title>
                <imprint>
                  <publisher>Wiley</publisher>
                  <biblScope unit="volume">100</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">294-314</biblScope>
                  <date type="datePub">2022-08-24</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1002/jgt.22779</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">polynomial algorithm</term>
                <term xml:lang="en">Semicomplete digraph</term>
                <term xml:lang="en">Tournament</term>
                <term xml:lang="en">Eulerian subdigraph</term>
                <term xml:lang="en">Arc-connectivity</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>A digraph is eulerian if it is connected and every vertex has its in-degree equal to its outdegree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs (D, a) of a semicomplete digraph D and an arc a such that D has a spanning eulerian subdigraph containing a. In particular, we show that if D is 2-arc-strong, then every arc is contained in a spanning eulerian subdigraph. We then characterize the pairs (D, a) of a semicomplete digraph D and an arc a such that D has a spanning eulerian subdigraph avoiding a. In particular, we prove that every 2-arc-strong semicomplete digraph has a spanning eulerian subdigraph avoiding any prescribed arc. We also prove the existence of a (minimum) function f (k) such that every f (k)-arc-strong semicomplete digraph contains a spanning eulerian subdigraph avoiding any prescribed set of k arcs. We conjecture that f (k) = k + 1 and establish this conjecture for k ≤ 3 and when the k arcs that we delete form a forest of stars. A digraph D is eulerian-connected if for any two distinct vertices x, y, the digraph D has a spanning (x, y)-trail. We prove that every 2-arc-strong semicomplete digraph is eulerianconnected. All our results may be seen as arc analogues of well-known results on hamiltonian paths and cycles in semicomplete digraphs.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-50786" status="VALID">
          <idno type="IdRef">076624099</idno>
          <idno type="ROR">https://ror.org/03yrrjy16</idno>
          <orgName>University of Southern Denmark = Syddansk Universitet</orgName>
          <orgName type="acronym">SDU</orgName>
          <desc>
            <address>
              <addrLine>5320 Odense</addrLine>
              <country key="DK"/>
            </address>
            <ref type="url">https://www.sdu.dk/en</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>