Injective edge coloring of graphs
Filomat, Tome 33 (2019) no. 19, p. 6411
Voir la notice de l'article provenant de la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
Three edges e1, e2 and e3 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 e1, e2 and e3 are consecutive edges in G, then c(e1) , c(e3). The injective edge coloring number χ ′ i (G) is the minimum number of colors permitted in such a coloring. In this paper, exact values of χ ′ i (G) for several classes of graphs are obtained, upper and lower bounds for χ′i (G) are introduced and it is proven that checking whether χ′i (G) = k is NP-complete
Classification :
05C15
Keywords: Injective coloring, injective edge coloring
Keywords: Injective coloring, injective edge coloring
Domingos M Cardoso; J Orestes Cerdeira; Charles Dominic; J Pedro Cruz. Injective edge coloring of graphs. Filomat, Tome 33 (2019) no. 19, p. 6411 . doi: 10.2298/FIL1919411C
@article{10_2298_FIL1919411C,
author = {Domingos M Cardoso and J Orestes Cerdeira and Charles Dominic and J Pedro Cruz},
title = {Injective edge coloring of graphs},
journal = {Filomat},
pages = {6411 },
year = {2019},
volume = {33},
number = {19},
doi = {10.2298/FIL1919411C},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.2298/FIL1919411C/}
}
TY - JOUR AU - Domingos M Cardoso AU - J Orestes Cerdeira AU - Charles Dominic AU - J Pedro Cruz TI - Injective edge coloring of graphs JO - Filomat PY - 2019 SP - 6411 VL - 33 IS - 19 UR - http://geodesic.mathdoc.fr/articles/10.2298/FIL1919411C/ DO - 10.2298/FIL1919411C LA - en ID - 10_2298_FIL1919411C ER -
Cité par Sources :