{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:52:21Z","timestamp":1753894341692,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"Graph and Algorithms","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Graphs and Algorithms<\/jats:p>\n          <jats:p xml:lang=\"en\">An edge colouring of a graph is said to be neighbour-distinguishing if any two adjacent vertices have distinct sets of colours of their incident edges. In this paper the list version of the problem of determining the minimum number of colours in a neighbour-distinguishing colouring of a given graph is considered.<\/jats:p>","DOI":"10.46298\/dmtcs.577","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T21:49:38Z","timestamp":1629755378000},"source":"Crossref","is-referenced-by-count":0,"title":["On neighbour-distinguishing colourings from lists"],"prefix":"10.46298","volume":"Vol. 14 no. 2","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-3588-8455","authenticated-orcid":false,"given":"Mirko","family":"Hor\u0148\u00e1k","sequence":"first","affiliation":[{"name":"Institute of Mathematics [Kosice, Slovakia]"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz","family":"Wo\u017aniaK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2012,8,16]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/577\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/577\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:10:20Z","timestamp":1687291820000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/dmtcs.episciences.org\/577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,16]]},"references-count":0,"journal-issue":{"issue":"Graph and Algorithms","published-online":{"date-parts":[[2012,8,16]]}},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.46298\/dmtcs.577","relation":{"is-same-as":[{"id-type":"uri","id":"https:\/\/2.zoppoz.workers.dev:443\/https\/hal.science\/hal-00990586v1","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2012,8,16]]},"article-number":"577"}}