Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

DM
2007

favoriteEmaildiscussreport

100views more DM 2007»

Improved bounds on acyclic edge colouring

13 years 4 months ago

Improved bounds on acyclic edge colouring

Download www.imsc.res.in

We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We also obtain a relationship between g and a (G). © 2007 Elsevier B.V. All rights reserved.

Rahul Muthu, N. Narayanan, C. R. Subramanian

Real-time Traffic

Acyclic Chromatic Index | Chromatic | DM 2007 | Girth Requirement |

claim paper

Related Content

» Acyclic Edge Colouring of Outerplanar Graphs

» Acyclic and Frugal Colourings of Graphs

» Acyclic improper colourings of graphs with bounded maximum degree

» Properly EdgeColoured Subgraphs in Colourings of Bounded Degree

» Acyclic dominating partitions

» Layouts of Graph Subdivisions

» Upward ThreeDimensional Grid Drawings of Graphs

» Forbidden Subgraph Colorings and the Oriented Chromatic Number

» The complexity of flow on fat terrains and its ioefficient computation

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	DM
Authors	Rahul Muthu, N. Narayanan, C. R. Subramanian

Comments (0)