Two smaller upper bounds of list injective chromatic number

An injective coloring of a graph is an assignment of colors to the vertices of so that any two vertices with a common neighbor receive distinct colors. Let denote the list injective chromatic number of . We prove that (1) for a graph with the maximum average degree and maximum degree ; (2) if is a plane graph with and without 3-, 4-, 8-cycles.