Sciweavers

JGT
2006
114views more  JGT 2006»
13 years 4 months ago
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, ...
Reza Naserasr, Claude Tardif