1. On core categorical product of (di)graphs. With and Cyril Pujol.
  2. Colouring negative exact-distance graphs of signed graphs. With Patrice Ossona de Mendez, Daniel A. Quiroz, Robert Šámal, Weiqiang Yu.
  3. Critically 3-frustrated signed graphs-II. With C. Cappello, E. Steffen, and Z. Wang.
  4. Balanced-chromatic number and Hadwiger-like conjectures.' With Andrea Jimenez, Jessica McDonald, Kathryn Nurse, and Daniel A. Quiroz.
  5. Sensitivity conjecture and signed hypercubes, with Sophie Laplante, Anupa Sunny, and Zhouningxin Wang.
  6. Winding number and circular 4-coloring of signed graphs, with Anna Gujgiczer, Rohini S, and S Taruni
  7. Cliques in exact distance powers of graphs of given maximum degree, with F. Foucaud, S. Mishra, N. Narayanan, P. Valicov.
  8. On powers of interval graphs and their orders. With F. Foucaud, A. Parreau, P. Valicov.
  9. On orthogonality graphs, with M. DeVos, M. Gheble, L. Goddyn, B. Mohar.
  10. Complexity of planar homomorphisms, with P. Hell, C. Tardif. We prove that $C_{2k+1}$-coloirng of planar graphs is NP-Complete. This is also proved with a different technique by G. MacGillivray and M. Siggers. Furthermore, we propose that perhaps H-coloring of planar graphs is NP-complete if H is a planar core but not isomorphic to $K_1, K_2, K_4$.
  11. Edge-Choosability of the Petersen Graph, with P. Haxell. Answering a question of B. Mohar we show that the multigraph obtained from the Petersen graph with each edge being replaced by k parallel edges is $3k$-choosable if and only if $k$ is an even number.
  12. Two conjectures on the list coloring number, with P. Haxell. We give a stronger reformulation of Reed's conjecture on list coloring number. The original conjecture was disproved by T. Bohman, R. Holzman, where Reed himself proved that his conjecture asymptotically is correct. With our re-formulation of the conjecture disproving the original claim becomes obvious.