Name
Abstract | ||
|---|---|---|
A proper edge-colouring with the property that every cycle contains edges of at least three distinct colours is called an acyclic edge-colouring. The acyclic chromatic index of a graph G, denoted χa′(G) is the minimum k such that G admits an acyclic edge-colouring with k colours. We conjecture that if G is planar and Δ(G) is large enough then χa′(G)=Δ(G). We settle this conjecture for planar graphs with girth at least 5 and outerplanar graphs. We also show that if G is planar then χa′(G)⩽Δ(G)+25. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.endm.2009.07.069 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
edge-colouring,graphs of bounded density,planar graph,outerplanar graph | Discrete mathematics,Outerplanar graph,Combinatorics,Graph power,Clique-sum,Planar straight-line graph,Chordal graph,Pathwidth,1-planar graph,Planar graph,Mathematics | Journal |
Volume | ISSN | Citations |
34 | 1571-0653 | 4 |
PageRank | References | Authors |
0.44 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nathann Cohen | 1 | 91 | 16.24 |
| Frédéric Havet | 2 | 433 | 55.15 |
| Tobias Müller | 3 | 214 | 15.95 |