Year: 2009
Author: Yanbin Jia, Changqing Xu
Communications in Mathematical Research , Vol. 25 (2009), Iss. 5 : pp. 429–432
Abstract
Let $G$ be a multigraph with vertex set $V(G)$. Assume that a positive integer $f(v$) with $1 ≤ f(v) ≤ d(v)$ is associated with each vertex $v ∈ V$. An edge coloring of $G$ is called an $f$-edge cover-coloring, if each color appears at each vertex $v$ at least $f(v)$ times. Let $χ′_{fc}(G)$ be the maximum positive integer $k$ for which an $f$-edge cover-coloring with $k$ colors of $G$ exists. In this paper, we give a new lower bound of $χ′_{fc}(G)$, which is sharp.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/2009-CMR-19360
Communications in Mathematical Research , Vol. 25 (2009), Iss. 5 : pp. 429–432
Published online: 2009-01
AMS Subject Headings: Global Science Press
Copyright: COPYRIGHT: © Global Science Press
Pages: 4
Keywords: edge coloring $f$-edge cover-coloring $f$-edge cover.