Shanise Walker, graduate student of mathematics, was one of the winners of the AWM poster session in the Joint Mathematics Meetings in San Diego.

The poster session was part of a larger workshop including a reception, luncheon and a mentoring session where workshop participants had the opportunity to meet with other women mathematicians at all stages of their careers. Walker especially enjoyed networking and attending other talks at the meeting.

“One of the things that excites me about being a winner is that I get an opportunity to attend one workshop from any Mathematics Institute of my choosing,” she said. “I am looking forward to finding a workshop to attend.”

Walker’s research title and abstract are below:

**Title:** Injective choosability of subcubic planar graphs with girth 6.

**Abstract:** An injective coloring of a graph G is an assignment of colors to the vertices of G so that any two vertices with a common neighbor have distinct colors. A graph G is injectively k-choosable if it has an injective coloring where the color of each vertex v of G can be chosen from any list L(v) of size k. Injective colorings have applications in the theory of error-correcting codes and are closely related to other notions of colorability. We show that a subcubic planar graph with girth at least 6 is injectively 5-choosable, which improves several known bounds on the injective chromatic number of planar graphs.