1. Circular (4-\epsilon)-coloring of signed graphs, with F. Kardos, J. Narboni, Z. Wang.
  2. Packing signatures in signed graphs, with W. Yu.
  3. Mapping sparse signed graphs to $(K_{2k}, M)$, with R. Skrekovski, Z. Wang, R. Xu.
  4. Density of $C_{-4}$-critical signed graphs, with L.A. Pham, Z. Wang.
  5. Complex and homomorphic chromatic number of signed planar simple graphs, with L.A. Pham.
  6. Cliques in exact distance powers of graphs of given maximum degree, with F. Foucaud, S. Mishra, N. Narayanan, P. Valicov.
  7. Sensitivity lower bounds from linear dependencies, with S. Laplante, A. Sunny.
  8. A New Graph Parameter To Measure Linearity Linear Structure and Graph Classes. with P. Charbit, M. Habib, L. Mouatadid.
  9. Smallest not $C_{2l+1}$-colorable graphs of odd-girth $2k+1$. with L. Beaudou F. Foucaud.
  10. On powers of interval graphs and their orders. With F. Foucaud, A. Parreau, P. Valicov.
  11. Finding roots of graphs, with D. Auger, Y. Bai, C. Delorme, P. Lebodic, B. Robillard
  12. On small \Delta-critical graphs.
  13. On orthogonality graphs, with M. DeVos, M. Gheble, L. Goddyn, B. Mohar.
  14. 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$.
  15. 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.
  16. 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.