Revisiting a theorem by Folkman on graph colouring - Archive ouverte HAL Access content directly
Journal Articles The Electronic Journal of Combinatorics Year : 2020

Revisiting a theorem by Folkman on graph colouring

(1) , (2) , (3) , (4) , (3) , (3) , (3) , (5)
1
2
3
4
5

Abstract

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.
Fichier principal
Vignette du fichier
BCD+.pdf (390 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02194900 , version 1 (26-07-2019)
hal-02194900 , version 2 (21-04-2020)

Identifiers

Cite

Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwénaël Joret, Aurélie Lagoutte, et al.. Revisiting a theorem by Folkman on graph colouring. The Electronic Journal of Combinatorics, 2020, 27 (1), pp.P1.56. ⟨10.37236/8899⟩. ⟨hal-02194900v2⟩
118 View
133 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More