Some bounds on the injective chromatic number of graphs
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\).
scientific article; zbMATH DE number 5687594