Some bounds on the injective chromatic number of graphs (Q960972): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
Property / DOI | |||
Property / DOI: 10.1016/j.disc.2009.04.020 / rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DISC.2009.04.020 / rank | |||
Normal rank |
Revision as of 10:07, 10 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Some bounds on the injective chromatic number of graphs |
scientific article |
Statements
Some bounds on the injective chromatic number of graphs (English)
0 references
29 March 2010
0 references
The authors consider the \textit{injective chromatic number} of a graph \(G\), which is defined as the minimal integer \(k\) such that there exists a colouring of the vertices of \(G\) with \(k\) colours, where no two vertices with a common neighbour have the same colour. Upper bounds for this injective chromatic number are derived in terms of the maximum degree of \(G\) and the maximum average degree of \(G\).
0 references
injective chromatic number
0 references
vertex colouring
0 references