The chromatic covering number of a graph

13 years 4 months ago

Download www.math.carleton.ca

Following [1], we investigate the problem of covering a graph G with induced subgraphs G1, . . . , Gk of possibly smaller chromatic number, but such that for every vertex u of G, the sum of reciproquals of the

Reza Naserasr, Claude Tardif

Real-time Traffic

JGT 2006 | Smaller Chromatic Number |

claim paper

Related Content

» The NonCrossing Graph

» Signed analogs of bipartite graphs

» Weak Borel chromatic numbers

» Circular Chromatic Number of Hypergraphs

» Total and fractional total colourings of circulant graphs

» On the adaptable chromatic number of graphs

» Cycle length parities and the chromatic number

» Vertex Cover in Graphs with Locally Few Colors

» The incidence game chromatic number

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JGT
Authors	Reza Naserasr, Claude Tardif

Comments (0)

Sciweavers

The chromatic covering number of a graph

JGT 2006 | Smaller Chromatic Number |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers