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 half the number of vertices and the independence number.
Document type :
Preprints, Working Papers, ...
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 : Friday, July 26, 2019 - 10:28:42 AM
Last modification on : Sunday, July 28, 2019 - 1:11:16 AM

File

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

Identifiers

  • HAL Id : hal-02194900, version 1

Citation

Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwénaël Joret, Aurélie Lagoutte, et al.. Revisiting a theorem by Folkman on graph colouring. 2019. ⟨hal-02194900⟩

Share

Metrics

Record views

37

Files downloads

28