<?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-03536425v2</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-17T03:34:30+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">On proper 2-labellings distinguishing by sums, multisets or products</title>
            <author role="aut">
              <persName>
                <forename type="first">Julien</forename>
                <surname>Bensmail</surname>
              </persName>
              <email type="md5">1655121c0bc635f4dba0dda68be887ec</email>
              <email type="domain">ens-lyon.fr</email>
              <idno type="idhal" notation="numeric">961237</idno>
              <idno type="halauthorid" notation="string">584927-961237</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Foivos</forename>
                <surname>Fioravantes</surname>
              </persName>
              <email type="md5">aa9ec1b8e7ae574165cf06bb9407a551</email>
              <email type="domain">gmail.com</email>
              <idno type="idhal" notation="string">foivos-fioravantes</idno>
              <idno type="idhal" notation="numeric">1200729</idno>
              <idno type="halauthorid" notation="string">1629026-1200729</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8217-030X</idno>
              <affiliation ref="#struct-211142"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Julien</forename>
                <surname>Bensmail</surname>
              </persName>
              <email type="md5">0850db10e6d735951449a096e0ebf207</email>
              <email type="domain">gmail.com</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2022-01-19 22:18:08</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2022-08-16 11:07:48</date>
              <date type="whenModified">2026-02-07 05:23:37</date>
              <date type="whenReleased">2022-08-24 09:55:08</date>
              <date type="whenProduced">2024</date>
              <date type="whenEndEmbargoed">2022-08-16</date>
              <ref type="file" target="https://hal.science/hal-03536425v2/document">
                <date notBefore="2022-08-16"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-03536425v2/file/2labels.pdf" id="file-3752034-3279179">
                <date notBefore="2022-08-16"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="164911">
                <persName>
                  <forename>Julien</forename>
                  <surname>Bensmail</surname>
                </persName>
                <email type="md5">0850db10e6d735951449a096e0ebf207</email>
                <email type="domain">gmail.com</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03536425</idno>
            <idno type="halUri">https://hal.science/hal-03536425</idno>
            <idno type="halBibtex">bensmail:hal-03536425</idno>
            <idno type="halRefHtml">&lt;i&gt;Discussiones Mathematicae Graph Theory&lt;/i&gt;, 2024, 4 (3), pp.863-878. &lt;a target="_blank" href="https://dx.doi.org/10.7151/dmgt.2473"&gt;&amp;#x27E8;10.7151/dmgt.2473&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Discussiones Mathematicae Graph Theory, 2024, 4 (3), pp.863-878. &amp;#x27E8;10.7151/dmgt.2473&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-3752034-3279179"/></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">On proper 2-labellings distinguishing by sums, multisets or products</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Julien</forename>
                    <surname>Bensmail</surname>
                  </persName>
                  <email type="md5">1655121c0bc635f4dba0dda68be887ec</email>
                  <email type="domain">ens-lyon.fr</email>
                  <idno type="idhal" notation="numeric">961237</idno>
                  <idno type="halauthorid" notation="string">584927-961237</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Foivos</forename>
                    <surname>Fioravantes</surname>
                  </persName>
                  <email type="md5">aa9ec1b8e7ae574165cf06bb9407a551</email>
                  <email type="domain">gmail.com</email>
                  <idno type="idhal" notation="string">foivos-fioravantes</idno>
                  <idno type="idhal" notation="numeric">1200729</idno>
                  <idno type="halauthorid" notation="string">1629026-1200729</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8217-030X</idno>
                  <affiliation ref="#struct-211142"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">43510</idno>
                <idno type="issn">1234-3099</idno>
                <idno type="eissn">2083-5892</idno>
                <title level="j">Discussiones Mathematicae Graph Theory</title>
                <imprint>
                  <publisher>University of Zielona Góra</publisher>
                  <biblScope unit="volume">4</biblScope>
                  <biblScope unit="issue">3</biblScope>
                  <biblScope unit="pp">863-878</biblScope>
                  <date type="datePub">2024</date>
                  <date type="dateEpub">2022-11-18</date>
                </imprint>
              </monogr>
              <idno type="doi">10.7151/dmgt.2473</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">product of labels</term>
                <term xml:lang="en">multiset of labels</term>
                <term xml:lang="en">sum of labels</term>
                <term xml:lang="en">proper labelling</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>Given a graph $G$, a $k$-labelling $\ell$ of $G$ is an assignment $\ell: E(G) \rightarrow \{1,\dots,k\}$ of labels from $\{1,\dots,k\}$ to the edges. We say that $\ell$ is s-proper, m-proper or p-proper, if no two adjacent vertices of $G$ are incident to the same sum, multiset or product, respectively, of labels.Proper labellings are part of the field of distinguishing labellings, and have been receiving quite some attention over the last decades, in particular in the context of the well-known 1-2-3 Conjecture. In recent years, quite some progress was made towards the main questions of the field, with, notably, the analogues of the 1-2-3 Conjecture for m-proper and p-proper labellings being solved. This followed mainly from a better global understanding of these types of labellings.In this note, we focus on a question raised by Paramaguru and Sampathkumar, who asked whether graphs with m-proper $2$-labellings always admit s-proper $2$-labellings. A negative answer to this question was recently given by Luiz, who provided infinite families of counterexamples.We give a more general result, showing that recognising graphs with m-proper $2$-labellings but no s-proper $2$-labellings is an \textsf{NP}-hard problem. We also prove a similar result for m-proper $2$-labellings and p-proper $2$-labellings, and raise a few directions for further work on the topic.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <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>