Back to Search Start Over

Note on graphs colouring

Authors :
Dănuţ Marcu
Source :
Le Matematiche, Vol 47, Iss 1, Pp 9-12 (1992)
Publication Year :
1992
Publisher :
Università degli Studi di Catania, 1992.

Abstract

In this paper, we give the maximal number of (k+r)-colouring of a graph with n vertices and chromatic number k. Also, we obtain the maximal values for chromatic polynomial of a graph.

Subjects

Subjects :
Mathematics
QA1-939

Details

Language :
English, French, Italian
ISSN :
03733505 and 20375298
Volume :
47
Issue :
1
Database :
Directory of Open Access Journals
Journal :
Le Matematiche
Publication Type :
Academic Journal
Accession number :
edsdoj.9013c8711b4d709198db9864a7c4f5
Document Type :
article