Some bounds on the injective chromatic number of graphs
type: Item
instance of: scholarly article
title: Some bounds on the injective chromatic number of graphs
zbMATH Open document ID: 1200.05078
author: Alain Doyon
author: Geňa Hahn
author: André Raspaud
published in: Discrete Mathematics
publication date: 2010-03-29T00:00:00Z
review text: 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\).
reviewed by: Markus Fulmek
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5687594
zbMATH Keywords: injective chromatic number
zbMATH Keywords: vertex colouring
Wikidata QID: Q114190780
MaRDI profile type: Publication
full work available at URL: j.disc.2009.04.020
OpenAlex ID: W2024469085
cites work: Q5422499
cites work: Minimum partition of a matroid into independent subsets
cites work: On the injective chromatic number of graphs
cites work: Q4382863
DOI: 10.1016/J.DISC.2009.04.020
description: scientific article; zbMATH DE number 5687594