par Bonamy, Marthe;Charbit, Pierre;Defrain, Oscar;Joret, Gwenaël 
;Lagoutte, Aurélie;Limouzy, Vincent;Pastor, Lucas;Sereni, Jean Sébastien
Référence The electronic journal of combinatorics, 27, 1, P1.56
Publication Publié, 2020-07-01
;Lagoutte, Aurélie;Limouzy, Vincent;Pastor, Lucas;Sereni, Jean SébastienRéférence The electronic journal of combinatorics, 27, 1, P1.56
Publication Publié, 2020-07-01
Article révisé par les pairs
| Résumé : | We give a short proof of the following theorem due to Jon H. Folkman (1969): The chromatic number of any graph is at most 2 plus the maximum over all subgraphs of the difference between the number of vertices and twice the independence number. |
