Some bounds on the injective chromatic number of graphs
From MaRDI portal
Publication:960972
DOI10.1016/j.disc.2009.04.020zbMath1200.05078OpenAlexW2024469085WikidataQ114190780 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
Related Items
INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH 7 ⋮ Injective coloring of planar graphs with girth 5 ⋮ List injective coloring of a class of planar graphs without short cycles ⋮ List injective coloring of planar graphs ⋮ Unnamed Item ⋮ List injective coloring of planar graphs with disjoint 5−-cycles ⋮ Connectivity of minimum non-5-injectively colorable planar cubic graphs ⋮ 2-distance coloring of planar graphs with girth 5 ⋮ Injective coloring of planar graphs with girth 6 ⋮ Graph equation for line graphs and \(m\)-step graphs ⋮ Some results on the injective chromatic number of graphs ⋮ Injective coloring of plane graphs with girth 5 ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Locally injective \(k\)-colourings of planar graphs ⋮ Injective \(\Delta +2\) coloring of planar graph without short cycles ⋮ Injective choosability of planar graphs of girth five and six ⋮ List injective coloring of planar graphs with girth 5, 6, 8 ⋮ Unnamed Item ⋮ Note on the perfect EIC-graphs ⋮ Coupon coloring of some special graphs ⋮ LIST INJECTIVE COLORING OF PLANAR GRAPHS WITH GIRTH g ≥ 5 ⋮ Injective coloring of planar graphs ⋮ Two smaller upper bounds of List injective chromatic number ⋮ Injective colorings of graphs with low average degree ⋮ Injective coloring of planar graphs ⋮ Injective choosability of subcubic planar graphs with girth 6 ⋮ Injective colorings of sparse graphs ⋮ Injective coloring of Halin graphs ⋮ List injective coloring of planar graphs with girth \(g \geq 6\) ⋮ Injective colorings of planar graphs with few colors
Cites Work
This page was built for publication: Some bounds on the injective chromatic number of graphs
