近似二部图的边覆盖染色并分析.pdfVIP

G(V,E) ℄ V (G) E (G) E = ∅. f V v ∈ V , 1 ≤ f (v) ≤ d(v). C , v ℄ f (v) C G f- ℄ f- k G f- ′ ′ χ (G). f (v) = 1 χ (G). fc c ′ ′ min{d(v) − (v) : v ∈ V } ≤ χ (G) ≤ δ. χ (G) = δ CI c c CII NP - G CI ℄ χ′ (G) fc f- i Æ THE EDGE COVERING COLORING OF NEARLY BIPARTITE GRAPHS ABSTRACT In the paper, all graphs considered are finite and undirected, which may have multiple edges but no loops. Let G be a multigraph with vertex set V (G) and edge set E (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 χ′ (G) be the maximum positive integer k for fc which an f-edge cover-coloring with k- colors of G exists. When f (v) = 1, It is called an edge cover-coloring, the chromatic index of G is denoted by ′ ′ χ (G). It is well known that min{d(v) − (v) : v ∈ V } ≤ χ (G) ≤ δ.