Skip to Main content Skip to Navigation
Journal articles

Revisiting a theorem by Folkman on graph colouring

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.
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02194900
Contributor : Jean-Sébastien Sereni <>
Submitted on : Tuesday, April 21, 2020 - 9:39:16 AM
Last modification on : Sunday, April 26, 2020 - 1:33:17 AM

File

BCD+.pdf
Files produced by the author(s)

Identifiers

Citation

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, Open Journal Systems, 2020, 27 (1), pp.P1.56. ⟨10.37236/8899⟩. ⟨hal-02194900v2⟩

Share

Metrics

Record views

31

Files downloads

39