Nordhaus-Guddam Type Relations of Three Graph Coloring Parameters

Kuo-Ching Huang, Ko-Wei Lih

Let G be a simple graph. A coloring of vertices of G is called (i) a 2-proper coloring if vertices at distance 2 receive distinct colors; (ii) an injective coloring if vertices pos…