Acyclic coloring of graphs of maximum degree five: Nine colors are enough

Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00300737
Contributor : André Raspaud <>
Submitted on : Friday, July 18, 2008 - 7:34:10 PM
Last modification on : Thursday, April 5, 2018 - 10:36:48 AM

Identifiers

  • HAL Id : hal-00300737, version 1

Citation

Guillaume Fertin, André Raspaud. Acyclic coloring of graphs of maximum degree five: Nine colors are enough. Information Processing Letters, Elsevier, 2008, pp.65-72. 〈hal-00300737〉

Share

Metrics

Record views

104