3-consecutive edge coloring of a graph

Csilla Bujtas, and Sampathkumar, E. and Zsolt Tuza, and Charles Dominic, and Pushpalatha, L. (2012) 3-consecutive edge coloring of a graph. Discrete Math., 312 (3). pp. 561-573.

[img] Text (Full Text)
1-s2.0-S0012365X11001543-main.pdf - Published Version
Restricted to Registered users only

Download (301Kb) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.disc.2011.04.006


This article studies the 3-consecutive edge coloring number, which is quite different from the classical notion in graph theory. 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 3-consecutive edge coloring number ψ′3c(G) of G is the maximum 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 or e3 receives the color of e2. This article is very interesting and meaningful, and it initiates the study of ψ′3c. The authors give the exact values of ψ′3c for some known graphs; they also prove that it is an algorithmically hard problem to determine ψ′3c in general.

Item Type: Article
Subjects: Physical Sciences > Mathematics
Divisions: Constituent Colleges > Yuvaraja's College Mysore > Mathematics
PG Campuses > Manasagangotri, Mysore > Mathematics
Depositing User: Kodandarama
Date Deposited: 22 May 2013 04:21
Last Modified: 24 Aug 2013 09:54
URI: http://eprints.uni-mysore.ac.in/id/eprint/10010

Actions (login required)

View Item View Item