Some bounds on the injective chromatic number of graphs

DOI10.1016/j.disc.2009.04.020zbMath1200.05078WikidataQ114190780 ScholiaQ114190780MaRDI QIDQ960972

Geňa Hahn, Alain Doyon, Andre Raspaud

Publication date: 29 March 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.04.020

zbMATH Keywords

vertex colouring; injective chromatic number

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5, Injective coloring of planar graphs, Injective coloring of planar graphs with girth 6, Injective coloring of plane graphs with girth 5, Locally injective \(k\)-colourings of planar graphs, Injective choosability of planar graphs of girth five and six, Coupon coloring of some special graphs, Injective colorings of graphs with low average degree, Injective colorings of sparse graphs, List injective coloring of planar graphs with girth \(g \geq 6\), Injective colorings of planar graphs with few colors, Graph equation for line graphs and \(m\)-step graphs, Some results on the injective chromatic number of graphs, Injective choosability of subcubic planar graphs with girth 6, Two smaller upper bounds of List injective chromatic number, List injective coloring of planar graphs with girth 5, 6, 8, INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7

Cites Work

• Unnamed Item
• Unnamed Item
• On the injective chromatic number of graphs
• Minimum partition of a matroid into independent subsets