Acyclic edge coloring of planar graphs with Delta colors - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2012

Acyclic edge coloring of planar graphs with Delta colors

Résumé

An acyclic edge coloring of a graph is a proper edge coloring without bichromatic cycles. In 1978, it was conjectured that ∆( G ) + 2 colors suffice for an acyclic edge coloring of every graph G. The conjecture has been verified for several classes of graphs, however, the best known upper bound for as special class as planar graphs are, is ∆ + 12 (Basavaraju and Chandran, 2009). In this paper, we study simple planar graphs which need only ∆( G ) colors for an acyclic edge coloring. We show that a planar graph with girth g and maximum degree ∆ admits such acyclic edge coloring if g ≥ 12, or g ≥ 8 and ∆ ≥ 4, or g ≥ 7 and ∆ ≥ 5, or g ≥ 6 and ∆ ≥ 6, or g ≥ 5 and ∆ ≥ 10. Our results improve some previously known bounds.
Fichier principal
Vignette du fichier
HKL_12.pdf (291.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00984521 , version 1 (28-04-2014)

Identifiants

  • HAL Id : hal-00984521 , version 1

Citer

Dávid Hudák, František Kardoš, Borut Lužar, Roman Soták, Riste Škrekovski. Acyclic edge coloring of planar graphs with Delta colors. Discrete Applied Mathematics, 2012, 160 (9), pp.1356-1368. ⟨hal-00984521⟩

Collections

TDS-MACS
60 Consultations
171 Téléchargements

Partager

Gmail Facebook X LinkedIn More