Name
Abstract | ||
|---|---|---|
Let G=(V,E) be a connected graph. For a symmetric, integer-valued function @d on VxV, where K is an integer constant, N"0 is the set of nonnegative integers, and Z is the set of integers, we define a C-mapping F:VxVxN"0->Z by F(u,v,m)[email protected](u,v)+m-K. A coloring c of G is an F-coloring if F(u,v,|c(u)-c(v)|)>=0 for every two distinct vertices u and v of G. The maximum color assigned by c to a vertex of G is the value of c, and the F-chromatic number F(G) is the minimum value among all F-colorings of G. For an ordering s:v"1,v"2,...,v"n of the vertices of G, a greedy F-coloring c of s is defined by (1) c(v"1)=1 and (2) for each i with 1= =0, for each j with 1= |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1016/S0012-365X(03)00182-1 | Discrete Mathematics |
Keywords | Field | DocType |
greedy f-coloring,05c45,f-chromatic number,greedy f-chromatic number,f-coloring,05c78,05c12,05c15,value function,connected graph | Integer,Graph theory,Graph,Discrete mathematics,Combinatorics,Bound graph,Vertex (geometry),Graph colouring,Grundy number,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
272 | 1 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.42 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gary Chartrand | 1 | 199 | 32.05 |
| Ladislav Nebesky | 2 | 70 | 16.59 |
| Ping Zhang | 3 | 292 | 47.70 |