conference paper

The hypocoloring problem: complexity and approximability results when the chromatic number is small

de Werra, D.  
•
Demange, M.
•
Monnot, J.
Show more
Hromovich, J.
•
Nagl, M.
Show more
2004
Graph-Theoretic Concepts in Computer Science. WG 2004
30th International Workshop, WG 2004
Type
conference paper
DOI
10.1007/978-3-540-30559-0_32
Web of Science ID

WOS:000227011800032

Author(s)
de Werra, D.  
Demange, M.
Monnot, J.
Paschos, V. T.
Editors
Hromovich, J.
•
Nagl, M.
•
Westfechtel, B.
Date Issued

2004

Publisher

Springer Verlag

Published in
Graph-Theoretic Concepts in Computer Science. WG 2004
Start page

377

End page

388

Written at

EPFL

EPFL units
ROSE  
Event nameEvent placeEvent date
30th International Workshop, WG 2004

Bad Honnef, Germany

June 21-23, 2004

Available on Infoscience
August 16, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/233068