On solving the queen graph coloring problem - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Lecture Notes in Computer Science Année : 2018

On solving the queen graph coloring problem

Résumé

The chromatic numbers of queen− n2 graphs are difficult to determine when n > 9 and n is a multiple of 2 or 3. In previous works [6, 7], we have proven that this number (denoted χn) is equal to n for n∈{12,14,15,16,18,20,21,22,24,28,32} and that χ10=11. This article describes how, by extending slightly further the previous work, the chromatic number of queen− 262 and queen− 302 can be obtained. A more general result, proving that χ2n=2n and χ3n=3n for infinitely many values of n, is then presented.
Fichier non déposé

Dates et versions

hal-01936609 , version 1 (27-11-2018)

Identifiants

Citer

Vasquez Michel., Yannick Vimont. On solving the queen graph coloring problem. IWOCA 2017: Combinatorial Algorithms. - Lectures Notes in Computer Science n°10765, Chap. 20. - p. 244-251, 2018, 978-3-319-78825-8. ⟨10.1007/978-3-319-78825-8_20⟩. ⟨hal-01936609⟩
37 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More