f-Class Two Graphs Whose f-Cores Have Maximum Degree Two

作     者：Xia ZHANG Gui Ying YAN Jian Sheng CAI 

作者机构：School of Mathematics ScienceShandong Normal University Academy of Mathematics and Systems ScienceChinese Academy of Sciences School of Mathematics and Information SciencesWeifang University 

出 版 物：《Acta Mathematica Sinica,English Series》 (数学学报（英文版）)

年 卷 期：2014年第30卷第4期

页      面：601-608页

核心收录：

学科分类：07[理学] 08[工学] 080203[工学-机械设计及理论] 070104[理学-应用数学] 0802[工学-机械工程] 0701[理学-数学] 

基　　金：Supported by National Natural Science Foundation of China(Grant Nos.10901097,11001055) Tianyuan Youth Foundation of Mathematics(Grant No.10926099) Natural Science Foundation of Shandong(Grant No.ZR2010AQ003) Shandong Province Higher Educational Science and Technology Program(Grant No.G13LI04)of China 

主　　题：f-Coloring simple graph f-chromatic index f-class 2 

摘      要：Abstract An f-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex v ∈ V（G） at most f（v） times. The f-core of G is the subgraph of G induced by the vertices v of degree d（v） = f（v）maxv∈y（G）{ [d（v）/f（v）l}. In this paper, we find some necessary conditions for a simple graph, whose f-core has maximum degree two, to be of class 2 for f-colorings.