Minimum sum coloring problem: Upper bounds for the chromatic strength - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2017

Minimum sum coloring problem: Upper bounds for the chromatic strength

Clément Lecat

Dates et versions

hal-03233800 , version 1 (25-05-2021)

Identifiants

Citer

Clément Lecat, Corinne Lucet, Chu Min Li. Minimum sum coloring problem: Upper bounds for the chromatic strength. Discrete Applied Mathematics, 2017, 233, pp.71-82. ⟨10.1016/j.dam.2017.07.025⟩. ⟨hal-03233800⟩
33 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More