Name
Abstract | ||
|---|---|---|
The group coloring of graphs is a new kind of graph coloring, introduced by Jaeger et al. in 1992, and the group chromatic number of a graph G is denoted by chi(g)(G). In this note, we prove that for a positive integer k, a graph G with chi(g)(G) > k can be obtained from any complete bipartite graph G(0) with chi(g)(G(0)) > k by certain types of graph operations. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1142/S1793830910000772 | DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS |
Keywords | Field | DocType |
Group coloring, list coloring | Discrete mathematics,Complete coloring,Edge coloring,Combinatorics,Edge-transitive graph,Graph power,Fractional coloring,List coloring,Mathematics,Voltage graph,Graph coloring | Journal |
Volume | Issue | ISSN |
2 | 3 | 1793-8309 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xinhui An | 1 | 18 | 5.55 |
| Baoyindureng Wu | 2 | 99 | 24.68 |