An improved bound on acyclic chromatic index of planar graphs - Details

author：

Guan, Y. (Guan, Y..) ^[1] | Hou, J. (Hou, J..) ^[2] | Yang, Y. (Yang, Y..) ^[3]

Indexed by：

Scopus

Abstract：

A　proper　edge　coloring　of　a　graph　G　is　called　acyclic　if　there　is　no　bichromatic　cycle　in　G.　The　acyclic　chromatic　index　of　G,　denoted　by　χa′(G),　is　the　least　number　of　colors　k　such　that　G　has　an　acyclic　k-edge-coloring.　Basavaraju　et　al.　[M.　Basavaraju,　L.S.　Chandran,　N.　Cohen,　F.　Havet　and　T.　Müller,　Acyclic　edge-coloring　of　planar　graphs,　SIAM　Journal　of　Discrete　Mathematics　25　(2)　(2011)　463-478]　showed　that　χa′(G)　≤Δ(G)+12　for　any　planar　graph　G　with　maximum　degree　Δ(G).　In　this　paper,　the　bound　is　improved　to　Δ(G)+10.　©　2013　Elsevier　B.V.　All　rights　reserved.

Keyword：

Acyclic edge coloring; Critical graph; Planar graph

Community：

[ 1 ] [Guan, Y.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 2 ] [Hou, J.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China
[ 3 ] [Yang, Y.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China

Reprint 's Address：

[Hou, J.]Center for Discrete Mathematics, Fuzhou University, Fujian, 350003, China

Email：

jfhou@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Discrete Mathematics

ISSN： 0012-365X

Year： 2013

Issue： 10

Volume： 313

Page： 1098-1103

0 . 5 6 6

JCR@2013

0 . 7 0 0

JCR@2023

JCR Journal Grade：3

CAS Journal Grade：4

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 8

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 3

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to