Competition numbers of planar graphs
  In this paper, we relate the competition number of a graph to its edge clique cover number by presenting a tight inequality $k(G) \ge \theta_e(G)-|V(G)|+\widetilde{k}(G)$ where $\theta_e(G)$, $k(G)$, and $\widetilde{k}(G)$ are the edge clique cover number, the competition number, and the co-competition number of a graph $G$, respectively. By utilizing this inequality and a notion of competition-effective edge clique cover, we obtain some meaningful results on competition numbers of planar graphs. 
Jihoon Choi, Soogang Eoh, and Suh-Ryung Kim
math.CO