Some bounds on the injective chromatic number of graphs
From MaRDI portal
Publication:960972
DOI10.1016/j.disc.2009.04.020zbMath1200.05078WikidataQ114190780 ScholiaQ114190780MaRDI QIDQ960972
Alain Doyon, Geňa Hahn, 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
05C15: Coloring of graphs and hypergraphs
Related Items
List injective coloring of a class of planar graphs without short cycles, Unnamed Item, List injective coloring of planar graphs with disjoint 5−-cycles, LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5, Injective coloring of planar graphs, Injective coloring of planar graphs, 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4, 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, 2-distance coloring of planar graphs with girth 5, Note on the perfect EIC-graphs, 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, Injective coloring of Halin graphs, Injective coloring of planar graphs with girth 5, List injective coloring of planar graphs, Connectivity of minimum non-5-injectively colorable planar cubic graphs, 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
