Sciweavers

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

32

WG
2004
Springer

favoriteEmaildiscussreport

85views Theoretical Computer Science» more WG 2004»

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

14 years 4 months ago

The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small

Download www.lamsade.dauphine.fr

Dominique de Werra, Marc Demange, Jérô

Real-time Traffic

Computer Science | WG 2004 |

claim paper

Post Info
More Details (n/a)

Added	03 Jul 2010
Updated	03 Jul 2010
Type	Conference
Year	2004
Where	WG
Authors	Dominique de Werra, Marc Demange, Jérôme Monnot, Vangelis Th. Paschos

Comments (0)