Two bounds of chromatic number in graphs coloring problem

Author

Gueham, Assia ; Nagih, Anass ; Ait Haddadene, Hacene

Author_Institution

Univ. of Algiers 3, Algiers, Algeria

fYear

2014

fDate

3-5 Nov. 2014

Firstpage

292

Lastpage

296

Abstract

In this paper, we focus on the coloration approach and estimation of chromatic number. We propose an upper bound of a chromatic number based on the orientation algorithm described in [4]. This upper bound is improved by developing a novel coloration algorithm. Finally, we make a theoretical and empirical comparison of our bounds with Brooks´s bound and Reed´s conjecture [15] for class of triangle-free graphs.

Keywords

graph colouring; number theory; Brooks´s bound; Reed´s conjecture; chromatic number estimation; chromatic number upper bound; coloration approach; graph coloring problem; orientation algorithm; triangle-free graphs; Color; Educational institutions; Electronic mail; Estimation; Laboratories; Polynomials; Upper bound; Chromatic number; Graph Coloring; Graph Orientation;

fLanguage

English

Publisher

ieee

Conference_Titel

Control, Decision and Information Technologies (CoDIT), 2014 International Conference on

Conference_Location

Metz

Type

conf

DOI

10.1109/CoDIT.2014.6996909

Filename

6996909

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1781643