The chromatic covering number of a graph

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

• Type: Journal
• Year: 2006
• Where: JGT
• Authors: Reza Naserasr, Claude Tardif
• Keywords: JGT 2006, Smaller Chromatic Number