On the circular chromatic number of circular partitionable graphs

13 years 4 months ago

Download www.math.nsysu.edu.tw

This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have

Arnaud Pêcher, Xuding Zhu

Real-time Traffic

Circular Chromatic Number | Circular Partitionable Graphs | Infinite Family | JGT 2006 |

claim paper

» On two questions about circular choosability

» Circular Chromatic Number and Mycielski Graphs

» Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

» Graphs with bounded treewidth and large oddgirth are almost bipartite

» The circular chromatic index of graphs of high girth

» Clawfree circularperfect graphs

» Coloring the Cartesian sum of graphs

» A note on the Hadwiger number of circular arc graphs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGT
Authors	Arnaud Pêcher, Xuding Zhu

Comments (0)

Sciweavers

On the circular chromatic number of circular partitionable graphs

Circular Chromatic Number | Circular Partitionable Graphs | Infinite Family | JGT 2006 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers