Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/27299
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cardoso, Domingos M. | pt_PT |
dc.contributor.author | Cerdeira, J. Orestes | pt_PT |
dc.contributor.author | Dominic, Charles | pt_PT |
dc.contributor.author | Cruz, J. Pedro | pt_PT |
dc.date.accessioned | 2020-01-16T18:04:42Z | - |
dc.date.available | 2020-01-16T18:04:42Z | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 0354-5180 | pt_PT |
dc.identifier.uri | http://hdl.handle.net/10773/27299 | - |
dc.description.abstract | Three edges $e_{1}, e_{2}$ and $e_{3}$ in a graph $G$ are consecutive if they form a path (in this order) or a cycle of lengths three. An injective edge coloring of a graph $G = (V,E)$ is a coloring $c$ of the edges of $G$ such that if $e_{1}, e_{2}$ and $e_{3}$ are consecutive edges in $G$, then $c(e_{1})\neq c(e_3)$. The injective edge coloring number $\chi_{i}^{'}(G)$ is the minimum number of colors permitted in such a coloring. In this paper, exact values of $\chi_{i}^{'}(G)$ for several classes of graphs are obtained, upper and lower bounds for $\chi_{i}^{'}(G)$ are introduced and it is proven that checking whether $\chi_{i}^{'}(G)= k$ is NP-complete. | pt_PT |
dc.language.iso | eng | pt_PT |
dc.publisher | Faculty of Sciences and Mathematics, University of Nis | pt_PT |
dc.relation | UID/MAT/04106/2019 | pt_PT |
dc.relation | UID/MAT/00297/2019 | pt_PT |
dc.rights | openAccess | pt_PT |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | pt_PT |
dc.subject | Injective coloring | pt_PT |
dc.subject | Injective edge coloring | pt_PT |
dc.title | Injective edge coloring of graphs | pt_PT |
dc.type | article | pt_PT |
dc.description.version | in publication | pt_PT |
dc.peerreviewed | yes | pt_PT |
degois.publication.firstPage | 6411 | pt_PT |
degois.publication.issue | 19 | pt_PT |
degois.publication.lastPage | 6423 | pt_PT |
degois.publication.title | Filomat | pt_PT |
degois.publication.volume | 33 | pt_PT |
dc.relation.publisherversion | https://www.pmf.ni.ac.rs/filomat | pt_PT |
dc.identifier.doi | 10.2298/FIL1919411C | pt_PT |
dc.identifier.essn | 2406-0933 | pt_PT |
Appears in Collections: | CIDMA - Artigos DMat - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
33-19-27-11820.pdf | 303 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.