<?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-04042967</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-22T00:20:44+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On Strict Brambles</title>
            <author role="aut">
              <persName>
                <forename type="first">Emmanouil</forename>
                <surname>Lardas</surname>
              </persName>
              <idno type="halauthorid">2765955-0</idno>
              <affiliation ref="#struct-425861"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Evangelos</forename>
                <surname>Protopapas</surname>
              </persName>
              <email type="md5">ff6b06dd91967926d0901b6b8c911884</email>
              <email type="domain">lirmm.fr</email>
              <idno type="idhal" notation="numeric">1240569</idno>
              <idno type="halauthorid" notation="string">2765956-1240569</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0294-2985</idno>
              <affiliation ref="#struct-1100628"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dimitrios M.</forename>
                <surname>Thilikos</surname>
              </persName>
              <email type="md5">b12f47ffd4c78cdb273f5b91bb335a0e</email>
              <email type="domain">thilikos.Info</email>
              <idno type="idhal" notation="string">dimitrios-m-thilikos</idno>
              <idno type="idhal" notation="numeric">178742</idno>
              <idno type="halauthorid" notation="string">17649-178742</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-0470-1800</idno>
              <idno type="IDREF">https://www.idref.fr/149337078</idno>
              <affiliation ref="#struct-1100628"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dimitris</forename>
                <surname>Zoros</surname>
              </persName>
              <email type="md5">66bfc8b6353c7c1d08242e9d970225dc</email>
              <email type="domain">math.uoa.gr</email>
              <idno type="idhal" notation="numeric">989350</idno>
              <idno type="halauthorid" notation="string">871130-989350</idno>
              <affiliation ref="#struct-425861"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Cathy</forename>
                <surname>Tuchming</surname>
              </persName>
              <email type="md5">e0c2c835abeebdc0d858ec4887082bbc</email>
              <email type="domain">lirmm.fr</email>
            </editor>
            <funder ref="#projanr-51688"/>
            <funder ref="#projanr-43303"/>
            <funder ref="#projanr-42363"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2023-10-17 11:49:23</date>
              <date type="whenModified">2025-12-02 03:18:17</date>
              <date type="whenReleased">2023-10-17 15:55:09</date>
              <date type="whenProduced">2023-04</date>
              <date type="whenEndEmbargoed">2023-10-17</date>
              <ref type="file" target="https://hal.science/hal-04042967v1/document">
                <date notBefore="2023-10-17"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-04042967v1/file/2201.05783.pdf" id="file-4245816-3704445">
                <date notBefore="2023-10-17"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/2201.05783"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="103115">
                <persName>
                  <forename>Cathy</forename>
                  <surname>Tuchming</surname>
                </persName>
                <email type="md5">e0c2c835abeebdc0d858ec4887082bbc</email>
                <email type="domain">lirmm.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-04042967</idno>
            <idno type="halUri">https://hal.science/hal-04042967</idno>
            <idno type="halBibtex">lardas:hal-04042967</idno>
            <idno type="halRefHtml">&lt;i&gt;Graphs and Combinatorics&lt;/i&gt;, 2023, 39 (2), pp.24. &lt;a target="_blank" href="https://dx.doi.org/10.1007/s00373-023-02618-y"&gt;&amp;#x27E8;10.1007/s00373-023-02618-y&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Graphs and Combinatorics, 2023, 39 (2), pp.24. &amp;#x27E8;10.1007/s00373-023-02618-y&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-4245816-3704445"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-MONTP3">Université de Montpellier Paul-Valéry</idno>
            <idno type="stamp" n="UNIV-PERP">Université Perpignan Via Domitia</idno>
            <idno type="stamp" n="ALGCO" corresp="LIRMM">Algorithmes, Graphes et Combinatoire</idno>
            <idno type="stamp" n="LIRMM">Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</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-MONTPELLIER">Université de Montpellier</idno>
            <idno type="stamp" n="ANR">ANR</idno>
            <idno type="stamp" n="UPVM-TI" corresp="UNIV-MONTP3">Publications UPVM texte intégral</idno>
            <idno type="stamp" n="UM-2015-2021" corresp="UNIV-MONTPELLIER">Université de Montpellier (2015-2021)</idno>
            <idno type="stamp" n="UM-EPE" corresp="UNIV-MONTPELLIER">Université de Montpellier - EPE</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 Strict Brambles</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Emmanouil</forename>
                    <surname>Lardas</surname>
                  </persName>
                  <idno type="halauthorid">2765955-0</idno>
                  <affiliation ref="#struct-425861"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Evangelos</forename>
                    <surname>Protopapas</surname>
                  </persName>
                  <email type="md5">ff6b06dd91967926d0901b6b8c911884</email>
                  <email type="domain">lirmm.fr</email>
                  <idno type="idhal" notation="numeric">1240569</idno>
                  <idno type="halauthorid" notation="string">2765956-1240569</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0294-2985</idno>
                  <affiliation ref="#struct-1100628"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dimitrios M.</forename>
                    <surname>Thilikos</surname>
                  </persName>
                  <email type="md5">b12f47ffd4c78cdb273f5b91bb335a0e</email>
                  <email type="domain">thilikos.Info</email>
                  <idno type="idhal" notation="string">dimitrios-m-thilikos</idno>
                  <idno type="idhal" notation="numeric">178742</idno>
                  <idno type="halauthorid" notation="string">17649-178742</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-0470-1800</idno>
                  <idno type="IDREF">https://www.idref.fr/149337078</idno>
                  <affiliation ref="#struct-1100628"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dimitris</forename>
                    <surname>Zoros</surname>
                  </persName>
                  <email type="md5">66bfc8b6353c7c1d08242e9d970225dc</email>
                  <email type="domain">math.uoa.gr</email>
                  <idno type="idhal" notation="numeric">989350</idno>
                  <idno type="halauthorid" notation="string">871130-989350</idno>
                  <affiliation ref="#struct-425861"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">13707</idno>
                <idno type="issn">0911-0119</idno>
                <idno type="eissn">1435-5914</idno>
                <title level="j">Graphs and Combinatorics</title>
                <imprint>
                  <publisher>Springer Verlag</publisher>
                  <biblScope unit="volume">39</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">24</biblScope>
                  <date type="datePub">2023-04</date>
                </imprint>
              </monogr>
              <idno type="arxiv">2201.05783</idno>
              <idno type="doi">10.1007/s00373-023-02618-y</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Strict bramble</term>
                <term xml:lang="en">Bramble</term>
                <term xml:lang="en">Treewidth</term>
                <term xml:lang="en">Lexicographic tree product number</term>
                <term xml:lang="en">Obstruction set</term>
                <term xml:lang="en">Tree decomposition</term>
                <term xml:lang="en">Lenient tree decomposition</term>
              </keywords>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</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>A strict bramble of a graph G is a collection of pairwise-intersecting connected subgraphs of G. The order of a strict bramble B is the minimum size of a set of vertices intersecting all sets of B. The strict bramble number of G, denoted by sbn(G), is the maximum order of a strict bramble in G. The strict bramble number of G can be seen as a way to extend the notion of acyclicity, departing from the fact that (non-empty) acyclic graphs are exactly the graphs where every strict bramble has order one. We initiate the study of this graph parameter by providing three alternative definitions, each revealing different structural characteristics. The first is a min-max theorem asserting that sbn(G) is equal to the minimum k for which G is a minor of the lexicographic product of a tree and a clique on k vertices (also known as the lexicographic tree product number). The second characterization is in terms of a new variant of a tree decomposition called lenient tree decomposition. We prove that sbn(G) is equal to the minimum k for which there exists a lenient tree decomposition of G of width at most k. The third characterization is in terms of extremal graphs. For this, we define, for each k, the concept of a k-domino-tree and we prove that every edge-maximal graph of strict bramble number at most k is a k-domino- tree. We also identify three graphs that constitute the minor-obstruction set of the class of graphs with strict bramble number at most two. We complete our results by proving that, given some G and k, deciding whether sbn(G) ≤ k is an NP-complete problem.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="department" xml:id="struct-425861" status="VALID">
          <orgName>Department of Mathematics [Athens]</orgName>
          <desc>
            <address>
              <addrLine>Panepistimioupolis, GR-157 84, Athens</addrLine>
              <country key="GR"/>
            </address>
            <ref type="url">http://noether.math.uoa.gr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-502478" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-1100628" status="VALID">
          <orgName>Algorithmes, Graphes et Combinatoire</orgName>
          <orgName type="acronym">LIRMM | ALGCO</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>LIRMM, 161 rue Ada, 34000 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr/equipes/ALGCO/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-1100620" type="direct"/>
            <relation active="#struct-101475" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="UMR5506" active="#struct-441569" type="indirect"/>
            <relation name="UMR5506" active="#struct-1100589" type="indirect"/>
            <relation active="#struct-1219853" type="indirect"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-502478" status="VALID">
          <idno type="ROR">https://ror.org/04gnjpq42</idno>
          <orgName>National and Kapodistrian University of Athens</orgName>
          <orgName type="acronym">NKUA</orgName>
          <date type="start">1837-04-14</date>
          <desc>
            <address>
              <addrLine>Athens 157 72</addrLine>
              <country key="GR"/>
            </address>
            <ref type="url">https://en.uoa.gr/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1100620" status="VALID">
          <idno type="IdRef">139590827</idno>
          <idno type="ISNI">0000000405990488</idno>
          <idno type="RNSR">199111950H</idno>
          <idno type="ROR">https://ror.org/013yean28</idno>
          <orgName>Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier</orgName>
          <orgName type="acronym">LIRMM</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>161 rue Ada - 34095 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lirmm.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-101475" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="UMR5506" active="#struct-441569" type="direct"/>
            <relation name="UMR5506" active="#struct-1100589" type="direct"/>
            <relation active="#struct-1219853" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-101475" status="VALID">
          <idno type="ROR">https://ror.org/03am2jy38</idno>
          <orgName>Université de Perpignan Via Domitia</orgName>
          <orgName type="acronym">UPVD</orgName>
          <desc>
            <address>
              <addrLine>52 avenue Paul Alduy - 66860 Perpignan Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-perp.fr/</ref>
          </desc>
        </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="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-1100589" status="VALID">
          <idno type="ROR">https://ror.org/051escj72</idno>
          <orgName>Université de Montpellier</orgName>
          <orgName type="acronym">UM</orgName>
          <date type="start">2022-01-01</date>
          <desc>
            <address>
              <addrLine>163 rue Auguste Broussonnet - 34090 Montpellier</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.umontpellier.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-1219853" status="VALID">
          <idno type="IdRef">282217916</idno>
          <orgName>Université de Montpellier Paul-Valéry</orgName>
          <orgName type="acronym">UMPV</orgName>
          <date type="start">2025-01-01</date>
          <desc>
            <address>
              <addrLine>Université de Montpellier Paul-Valéry Route de Mende 34199 Montpellier Cedex 5</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-montp3.fr/fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="anrProject" xml:id="projanr-51688" status="VALID">
          <idno type="anr">ANR-20-CE92-0027</idno>
          <orgName>UTMA</orgName>
          <desc>Théories Unifiantes dans les Algorithmes Multivarieés</desc>
          <date type="start">2020</date>
        </org>
        <org type="anrProject" xml:id="projanr-43303" status="VALID">
          <idno type="anr">ANR-17-CE23-0010</idno>
          <orgName>ESIGMA</orgName>
          <desc>Efficacité et structure pour les applications de la fouille de graphes</desc>
          <date type="start">2017</date>
        </org>
        <org type="anrProject" xml:id="projanr-42363" status="VALID">
          <idno type="anr">ANR-16-CE40-0028</idno>
          <orgName>DE-MO-GRAPH</orgName>
          <desc>Décomposition de Modèles Graphiques</desc>
          <date type="start">2016</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>