Sciweavers

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

8

EJC
2000

favoriteEmaildiscussreport

105views Information Technology» more EJC 2000»

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

13 years 4 months ago

Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

Download www.math.ntu.edu.tw

Lingling Huang, Gerard J. Chang

Real-time Traffic

EJC 2000 | EJC 2007 |

claim paper

Related Content

» The PlaneWidth of Graphs

» Fractional chromatic number of distance graphs generated by twointerval sets

» On the Acyclic Chromatic Number of Hamming Graphs

» On the editing distance of graphs

» On the chromatic number of random geometric graphs

» Distance Join Queries of Multiple Inputs in Spatial Databases

» Listcoloring the square of a subcubic graph

» The Swap Edges of a MultipleSources Routing Tree

» New Tools for Graph Coloring

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	EJC
Authors	Lingling Huang, Gerard J. Chang

Comments (0)