{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:03:15Z","timestamp":1775120595853,"version":"3.50.1"},"reference-count":0,"publisher":"National Library of Serbia","issue":"19","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/publicdomain\/zero\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Filomat"],"published-print":{"date-parts":[[2019]]},"abstract":"<jats:p>Three edges e1, e2 and e3 in a graph G are consecutive if they form a path\n   (in this order) or a cycle of lengths three. An injective edge coloring of a\n   graph G = (V, E) is a coloring c of the edges of G such that if e1, e2 and\n   e3 are consecutive edges in G, then c(e1)? c(e3). The injective edge\n   coloring number ?'i(G) is the minimum number of colors permitted in such\n   a coloring. In this paper, exact values of ?'i(G) for several classes of\n   graphs are obtained, upper and lower bounds for ?'i(G) are introduced and\n   it is proven that checking whether ?'i(G) = k is NP-complete.<\/jats:p>","DOI":"10.2298\/fil1919411c","type":"journal-article","created":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T10:57:11Z","timestamp":1583924231000},"page":"6411-6423","source":"Crossref","is-referenced-by-count":41,"title":["Injective edge coloring of graphs"],"prefix":"10.2298","volume":"33","author":[{"suffix":"M.","given":"Domingos","family":"Cardoso","sequence":"first","affiliation":[{"name":"Center for Research and Development in Mathematics and Applications, Department of Mathematics, Universidade de Aveiro, Aveiro, Portugal"}]},{"suffix":"J.","given":"Orestes","family":"Cerdeira","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Center of Mathematics and Applications (CMA), Faculty of Sciences and Technology, New University of Lisbon, Caparica, Portugal"}]},{"given":"Charles","family":"Dominicc","sequence":"additional","affiliation":[{"name":"Department of Mathematics, CHRIST(Deemed to be University), Begaluru, Karnataka, India"}]},{"suffix":"J.","given":"Pedro","family":"Cruz","sequence":"additional","affiliation":[{"name":"Center for Research and Development in Mathematics and Applications, Department of Mathematics, Universidade de Aveiro, Aveiro, Portugal"}]}],"member":"1078","container-title":["Filomat"],"original-title":[],"language":"en","deposited":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T08:13:48Z","timestamp":1685348028000},"score":1,"resource":{"primary":{"URL":"https:\/\/doiserbia.nb.rs\/Article.aspx?ID=0354-51801919411C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":0,"journal-issue":{"issue":"19","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.2298\/fil1919411c","relation":{},"ISSN":["0354-5180","2406-0933"],"issn-type":[{"value":"0354-5180","type":"print"},{"value":"2406-0933","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}