The circular chromatic index of graphs of high girth

15 years 2 months ago

Download www.math.nsysu.edu.tw

We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic index of G is at most ∆ + ε.

Tomás Kaiser, Daniel Král, Riste Skr

Real-time Traffic

Circular Chromatic Index | Integer | JCT 2007 | Maximum Degree |

claim paper

» On a construction of graphs with high chromatic capacity and large girth

» Oriented vertex and arc colorings of outerplanar graphs

» Oriented vertex and arc colorings of partial 2trees

» On the adaptable chromatic number of graphs

» Circular chromatic index of Cartesian products of graphs

» A separation theorem in property testing

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Tomás Kaiser, Daniel Král, Riste Skrekovski, Xuding Zhu

Comments (0)

Sciweavers

The circular chromatic index of graphs of high girth

Circular Chromatic Index | Integer | JCT 2007 | Maximum Degree |

Explore & Download

Productivity Tools

Sciweavers