Note on the perfect EIC-graphs

Jun Yue, Shiliang Zhang and Xia Zhang

Applied Mathematics and Computation, 2016, vol. 289, issue C, 481-485

Abstract: Three edges e1, e2 and e3 in a graph G are consecutive if they form a path (in this order) or a cycle of length 3. The injective edge coloring number χi′(G) is the minimum number of colors permitted in a coloring of the edges of G such that if e1, e2 and e3 are consecutive edges in G, then e1 and e3 receive the different colors. Let ω′ denote the number of edges in a maximum clique of G. A graph G is called an ω′ edge injective colorable (or perfect EIC-)graph if χi′(G)=ω′. In this paper, we give a sharp bound of the injective coloring number of a 2-connected graph with some forbidden conditions, and then we also characterize some perfect EIC-graph classes, which extends the results of perfect EIC-graph of Cardoso et al. in [Injective edge chromatic index of a graph, http://arxiv.org/abs/1510.02626.].

Keywords: Edge coloring; Injective coloring; Injective edge coloring; Injective edge chromatic index; Perfect EIC-graph (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031630340X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:289:y:2016:i:c:p:481-485

DOI: 10.1016/j.amc.2016.05.031

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().