# 信息来源：发布日期: 2021-11-10　 浏览次数: _showDynClicks("wbnews", 1756464364, 1371)

Let $G=(V,E)$ be a simple graph with vertex set $V$ and edge set $E$.Define an integer-valued function $f$ on $V$ such that $f(v)> 0$for every $v\in V$. An $f$-coloring of $G$ is an edge-coloring of itsuch that each color class appears at every vertex $v\in V(G)$ atmost $f(v)$ times. In this talk, we give some results on the f-colorings of graphs and random graphs.