Injective Colorings with Arithmetic Constraints

An injective coloring of a graph is a vertex labeling such that two vertices sharing a common neighbor get different labels. In this work we introduce and study what we call additive colorings. An injective coloring of a graph is an additive coloring if for every in , . The smallest integer such that an injective (resp. additive) coloring of a given graph exists with colors (resp. colors in ) is called the injective (resp. additive) chromatic number (resp. index). They are denoted by and , respectively. In the first part of this work, we present several upper bounds for the additive chromatic index. On the one hand, we prove a super linear upper bound in terms of the injective chromatic number for arbitrary graphs, as well as a linear upper bound for bipartite graphs and trees. Complete graphs are extremal graphs for the super linear bound, while complete balanced bipartite graphs are extremal graphs for the linear bound. On the other hand, we prove a quadratic upper bound in terms of the maximum degree. In the second part, we study the computational complexity of computing . We prove that it can be computed in polynomial time for trees. We also prove that for bounded treewidth graphs, to decide whether , for a fixed , can be done in polynomial time. On the other hand, we show that for cubic graphs it is NP-complete to decide whether . We also prove that for every there is a polynomial time approximation algorithm with approximation factor for , when restricted to split graphs. However, unless , for every there is no polynomial time approximation algorithm with approximation factor for , even when restricted to split graphs.