排序方式: 共有4条查询结果,搜索用时 15 毫秒
1
1.
图G的一个超f - 边覆盖染色就是它的一个f - 边覆盖染色并且使得图G中的重边染上不同的颜色. 令χHfc(G)是图G存在一个超f - 边覆盖染色时所需最大的颜色数k. χHfc(G)称作是图G的超f - 边覆盖染色色数. 本文讨论重图的超f - 边覆盖染色的存在性并且给出了重图的超f - 边覆盖染色的色数下界. 相似文献
2.
An f-edge cover-colouring of a graph G = (V, E) is an assignment of colours to the edges of G such that every colour appears at each vertex υ∈ V at least f(υ) times.The maximum number of colours needed to f-edge cover colour G is called the f-edge cover chromatic index of G, denoted by χfc(G). This paper gives that min[d(ν)-1/f(ν)] ≤χfc(G) ≤min[d(υ)/f(υ)]. 相似文献
3.
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 X'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 X'fc(G), which is sharp. 相似文献
4.
1