Name
Abstract | ||
|---|---|---|
The star k-edge-coloring of graph G is a proper edge coloring using k colors such that no path or cycle of length four is bichromatic. The minimum number k for which G admits a star k-edge-coloring is called the star chromatic index of G, denoted by chi(s)' (G). Let GCD(n, k) be the greatest common divisor of n and k. In this paper, we give a necessary and sufficient condition of chi(s)' (P(n, k)) = 4 for a generalized Petersen graph P(n, k) and show that "almost all" generalized Petersen graphs have a star 5-edge-colorings. Furthermore, for any two integers k and n (>= 2k + 1) such that GCD(n, k) >= 3, P(n, k) has a star 5-edge-coloring, with the exception of the case that GCD(n, k) = 3, k not equal GCD(n, k) and n/3 1 (mod 3). |
Year | DOI | Venue |
|---|---|---|
2021 | 10.7151/dmgt.2195 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | DocType | Volume |
star edge-coloring, star chromatic index, generalized Petersen graph | Journal | 41 |
Issue | ISSN | Citations |
2 | 1234-3099 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zehui Shao | 1 | 119 | 30.98 |
| Enqiang Zhu | 2 | 0 | 1.35 |