文献类型：期刊文献

英文题名：On the f-chromatic class of a multi-wheel graph

作者：Zhang, Xia[1];Zhu, Yan[2]

机构：[1]Shandong Normal Univ, Sch Math Sci, Jinan 250014, Peoples R China;[2]East China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China

年份：2016

卷号：129

起止页码：43

外文期刊名：ARS COMBINATORIA

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000384963500004)】；

基金：This research is supported by NSFC (Grant No. 10901097), the Joint Funds of Department of Education under the Natural Science Funds of Shandong Province (Grant No. ZR2014JL001), the Shandong Province Higher Educational Science and Technology Program (Grant No. J13L104), the Excellent Young Scholars Research Fund of Shandong Normal University and the Fundamental Research Funds for the Central Universities of China.

语种：英文

外文关键词：Edge-coloring; f-Coloring; Classification of graph; f-Chromatic index; Multi-wheel graphs

摘要：An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v is an element of V (G) at most f(v) times. A multi-wheel graph is a graph obtained from s cycles C-n1, C-n2,..., C-ns (s >= 1) by adding a new vertex, say w, and edges joining w to all the vertices of the s cycles. In this article, we solve a conjecture posed by Yu et al. in 2006 and prove that it is not always true. Furthermore, the classification problem of multi-wheel graphs on f-colorings is solved completely.