Name
Abstract | ||
|---|---|---|
An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index a^'(G) of G is the smallest integer k such that G has an acyclic edge coloring using k colors. Fiamcik (1978) and later Alon, Sudakov and Zaks (2001) conjectured that a^'(G)@?@D+2 for any simple graph G with maximum degree @D. In this paper, we show that if G is a planar graph without a 3-cycle adjacent to a 4-cycle, then a^'(G)@?@D+2, i.e., this conjecture holds. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.dam.2013.04.004 | Discrete Applied Mathematics |
Keywords | Field | DocType |
smallest integer k,k color,bichromatic cycle,maximum degree,acyclic chromatic index,acyclic edge,planar graph,simple graph,graph g,proper edge,cycle | Discrete mathematics,Edge coloring,Complete coloring,Combinatorics,Graph power,Fractional coloring,List coloring,Brooks' theorem,Greedy coloring,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
161 | 16-17 | 0166-218X |
Citations | PageRank | References |
1 | 0.35 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiqiao Wang | 1 | 494 | 42.81 |
| Qiaojun Shu | 2 | 36 | 4.82 |
| Weifan Wang | 3 | 868 | 89.92 |