IJPAM: Volume 102, No. 2 (2015)
Jl. Telekomunikasi 1, Bandung 40257, INDONESIA
Bandung Institute of Technology
Jl. Ganesa 10, Bandung 40132, INDONESIA
Universitat Politècnica de Catalunya (UPC)
C/Jordi Girona 1-3, E-08034 Barcelona, SPAIN
Abstract. Let be a graph and a positive integer be a function. An f-coloring of is a coloring of the edges such that every vertex is incident to at most edges of the same color. The minimum number of colors of an -coloring of is the f-chromatic index of . Based on the -chromatic index, a graph can be either in class , if , or in class , if , where . In this paper, we give some sufficient conditions for a graph to be in . One of the results is a generalization of a theorem by Zhang et al. (2008). Moreover, we show that, when is constant and a divisor of , a maximal subgraph of the complete graph which is in class has precisely edges.
Received: January 20, 2015
AMS Subject Classification: 05C15
Key Words and Phrases: edge coloring, -coloring, -chromatic index
Download paper from here.
DOI: 10.12732/ijpam.v102i2.3 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 201 - 207
BASED ON -COLORING%22&as_occt=any&as_epq=&as_oq=&as_eq=&as_publication=&as_ylo=&as_yhi=&as_sdtAAP=1&as_sdtp=1" title="Click to search Google Scholar for this entry" rel="nofollow">Google Scholar; DOI (International DOI Foundation); WorldCAT.