摘要
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.
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.
基金
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