{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T03:58:36Z","timestamp":1763092716245,"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\">Given a graph G = (V; E) and a weight function omega : E -\\textgreater R, a coloring of vertices of G, induced by omega, is defined by chi(omega) (nu) = Sigma(e(sic)nu) omega (e) for all nu is an element of V. In this paper, we show that determining whether a particular graph has a weighting of the edges from \\1, 2\\ that induces a proper vertex coloring is NP-complete.<\/jats:p>","DOI":"10.46298\/dmtcs.548","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T21:48:33Z","timestamp":1629755313000},"source":"Crossref","is-referenced-by-count":3,"title":["On the complexity of vertex-coloring edge-weightings"],"prefix":"10.46298","volume":"Vol. 13 no. 3","author":[{"given":"Andrzej","family":"Dudek","sequence":"first","affiliation":[{"name":"Department of Mathematics [Kalamazoo]"}]},{"given":"David","family":"Wajc","sequence":"additional","affiliation":[{"name":"Department of Computer Science [Haifa]"}]}],"member":"25203","published-online":{"date-parts":[[2011,11,6]]},"container-title":["Discrete Mathematics &amp; Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dmtcs.episciences.org\/548\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dmtcs.episciences.org\/548\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:09:23Z","timestamp":1687291763000},"score":1,"resource":{"primary":{"URL":"https:\/\/dmtcs.episciences.org\/548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,6]]},"references-count":0,"journal-issue":{"issue":"Graph and Algorithms","published-online":{"date-parts":[[2011,11,6]]}},"URL":"https:\/\/doi.org\/10.46298\/dmtcs.548","relation":{"is-same-as":[{"id-type":"uri","id":"https:\/\/hal.science\/hal-00990502v1","asserted-by":"subject"}]},"ISSN":["1365-8050"],"issn-type":[{"type":"electronic","value":"1365-8050"}],"subject":[],"published":{"date-parts":[[2011,11,6]]},"article-number":"548"}}