1. Circular Chromatic Number of Signed Graphs. The Electronic Journal of Combinatorics, Volume 28, Issue 2, 2021, Paper No. 2.44, 40 pp. With Z. Wang, X. Zhu. [DOI] [Link]
  2. Extension of Gyarfas-Sumner conjecture to digraphs. The Electronic Journal of Combinatorics, Volume 28, Issue 2, 2021, Paper No. 2.27, 19 pp. With P. Aboulker, P. Charbit. [DOI] [Link]
  3. Exact square coloring of subcubic planar graphs. Discrete Applied Mathematics, 293 (2021), 74–89. With F. Foucaud, H. Hocquard, S. Mishra, N. Narayanan, E. Sopena, P. Valicov. [DOI] [PDF]
  4. Edge clique covers in graphs with independence number 2. Journal of Graph Theory, 97(2), (2021) 324-339. With P. Charbit, G. Hahn,, M. Kaminski, M. Lafond, N. Lichiardopol, B. Seamone, R. Sherkati. [DOI] [PDF]
  5. The homomorphism order of signed graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 116 (2021), 169–182. With S. Sen, E. Sopena. [PDF]
  6. Bounding signed series-parallel graphs and cores of signed K_4_-subdivisions. Journal of Combinatorial Mathematics and Combinatorial Computing, 116 (2021), 27–51. With Z. Wang. [PDF]
  7. Homomorphisms of signed graphs: an update. European Journal of Combinatorics, 91 (2021), 103222. With E. Sopena, T. Zaslavsky. [DOI] [PDF]
  8. Homomorphisms of partial $t$-trees and edge-coloring of partial 3-trees. Journal of Combinatorial Series B, 145 (2020) 1-31. With Meirun Chen. [DOI] [PDF]
  9. Homomorphisms of sparse signed graphs. The Electronic Journal of Combinatorics, Volume 27, Issue 3, 2020, Paper No. 3.6. With C. Charpentier, E. Sopena. [DOI] [LINK]
  10. On the Structure of Small Strength-2 Covering Arrays. Journal of Combinatorial Designs 28(1) (2020) 5-24. With J. I. Kokkala, K. Meagher, K. J. Nurmela, P. R. J. Östergård, and B. Stevens. [DOI] [PDF]
  11. Homomorphism bounds of signed bipartite $K_4$-minor-free graphs and edge-colourings of $2k$-regular $K_4$-minor-free multigraphs. Discrete Applied Mathematics 261 (2019) 40-51. With L. Beaudou, F. Foucaud. [DOI] [PDF]
  12. When an optimal dominating set with given constraints exists. Theoretical Computer Science 780 (2019) 54-65. With O. Etesami, N. Ghareghani, M. Habib, M. Hooshmandasl, P. Sharifani. [DOI] [PDF]
  13. A new approach towards a conjecture on intersecting three longest paths. Journal Of Combinatorics, 10(2) (2019) 221 - 234. With S. Fujita, M. Furuya, K. Ozeki. [DOI] [PDF]
  14. The optimal routing of Augmented cubes. Information processing letter, 136 (2018) 59-63. With Meirun Chen. [DOI] [PDF]
  15. Safe Sets in Graphs: Graph Classes and Structural Parameters. Journal Of Combinatorial Optimization 36(4) (2018) 1221–1242. With R. Agueda, N. Cohen, S. Fujita, S. Legay, Y. Manoussakis, Y. Matsui, L. Montero, Y. Otachi, T. Sakuma, Z. Tuza, R. Xu. [DOI]
  16. The complexity of tropical graph homomorphisms. Discrete Applied Mathematics 229 (2017), 64–81. With F. Foucaud, A. Harutyunyan, P. Hell, S. Legay, Y. Manoussakis. [DOI] [PDF]
  17. Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity. Algorithmica 78(3) (2017) 914-944. With F. Foucaud, G. B. Mertzios, A. Parreau and P. Valicov. [DOI] [PDF]
  18. Homomorphism bounds and edge-colourings of K4-minor-free graphs. J. Combin. Theory, Ser. B, 124 (2017), 128–164. With L. Beaudou, F. Foucaud. [DOI] [PDF]
  19. Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theoretical Computer Science 668 (2017), 43–58. With F. Foucaud, G. B. Mertzios, A. Parreau and P. Valicov. [DOI][PDF]
  20. The complexity of signed and edge-coloured graph homomorphisms. Discrete Mathematics, 340(2) (2017) 223-235. With R. C. Brewster, F. Foucaud, P. Hell. [DOI] [PDF]
  21. Bipartite edge partitions and the former Alon-Saks-Seymour. The Australasian Journal of Combinatorics 66 (2016), 211–228. With Z. Gao, B. D. McKay, B. Stevens. [LINK]
  22. Walk-powers and homomorphism bounds of planar signed graphs. Graphs and Combinatorics 32(4) (2016) 1505–1519. With S. Sen, Q. Sun. [DOI] [PDF]
  23. Mapping planar graphs into the Coxeter graph. Discrete Mathematics 339(2) (2016), 839-849. With A. Harutyunyan, M. Petrusevski, R. Skrekovski, Q. Sun. [DOI] [PDF]
  24. Homomorphisms of projective cubes. Discrete Mathematics 338(12) (2015), 2539-2544. With L. Beaudou, C. Tardif. [DOI] [PDF]
  25. From edge-coloring to strong edge-coloring. The Electronic Journal of Combinatorics, Volume 22, Issue 2, 2015. With V. Borozan, G. Jennhwa Chang, N. Cohen, S. Fujita, N. Narayanan, P. Valicov. [DOI][LINK]
  26. Homomorphisms of signed graphs, Journal of Graph Theory 79(3) (2015), 178-212. With É. Sopena, E. Rollová. [DOI] [PDF]
  27. Homomorphisms of planar signed graphs to signed projective cubes. Discrete Mathematics & Theoretical Computer Science 15(3) (2013) 1-12. With E. Rollová, É. Sopena. [LINK]
  28. Mapping planar graphs into projective cubes. Journal of Graph theory 74(3) (2013) 249-259. [DOI] [PDF]
  29. Identifying codes in line graphs, Journal of Graph Theory 73(4) (2013) 425-448. With F. Foucaud, S. Gravier, A. Parreau, P. Valicov. [DOI] [PDF]
  30. Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets. Graphs and Combinatorics 29(3) (2013) 463-473. With F. Foucaud, A. Parreau. [DOI] [PDF]
  31. Vertex-colouring edge-weightings with two edge weights. Discrete Mathematics & Theoretical Computer Science 14(1) (2012) 1–20. With M. Khatirinejad, M. Newman, B. Seamone, B. Stevens. [LINK]
  32. Extremal graphs for the identifying code problem. European Journal of Combinatorics 32(4) (2011) 628–638. With F. Foucaud, E. Guerrini, M. Kovse, A. Parreau, P. Valicov. [DOI] [PDF]
  33. Digraphs are 2-weight choosable. Electronic Journal of Combinatorics 18(1) (2011), P21. With M. Khatirinejad, M. Newman, B. Seamone, B. Stevens. [DOI] [LINK]
  34. Homomorphisms of triangle-free graphs without a $K_5$-minor. Discrete Mathematics 309 (18) (2009) 5789–5798. With Y. Nigussie, R. Skrekovski. [DOI] [PDF]
  35. Circular coloring the plane. SIAM Journal on Discrete Mathematics 21 (2007) 461–465. With M. DeVos, J. Ebrahimi, M. Ghebleh, L. Goddyn, B. Mohar. [DOI] [PDF]
  36. Homomorphisms and edge colourings of planar graphs. Journal of Combinatorial Theory Ser. B 97(3) (2007) 394-400. [DOI] [PDF]
  37. On a new reformulation of Hadwiger's conjecture. Discrete Mathematics 306(23) (2006) 3136–3139. With Y. Nigussie. [DOI] [PDF]
  38. $K_5$-free bound for the class of planar graphs. European Journal of Combinatorics 27(7) (2006) 1155–1158. [DOI] [PDF]
  39. Homomorphism bounded classes of graphs. European Journal of Combinatorics 27(4) (2006) 592–600. With T. H. Marshall, J. Nesetril. [DOI] [PDF]
  40. The chromatic covering number of a graph. Journal Graph Theory 51(3) (2006) 199–204. With C. Tardif. [DOI] [PDF]
  41. On some parameters related to uniquely vertex-colourable graphs and defining sets. Ars Combinatoria 69 (2003) 301-318. With A. Daneshgar.
  42. The Petersen graph is not 3-edge-colorable - a new proof. Discrete Mathematics 268(1-3) (2003) 325-326. With R. \v Skrekovski. [DOI] [PDF]
  43. Ternary trades and their codes. Special issue in honor of S. S. Shrikhande. Journal of Statistical Planning and Inference 95(1-2) (2001) 237-243. With G.B. Khosrovshahi, B. Tayfeh-Rezaie. [DOI]
  44. On small uniquely vertex-colourable graphs and Xu's conjecture. Discrete Mathematics 23 (2000) 93-108. With A. Daneshgar. [DOI]
  45. On defining sets of vertex coloring of the cartesian product of a cycle and a complete graph. Graphs, combinatorics and algorithms (Y. Alavi and A. J. Schewenk, eds) Wiley New York, 1997. With E.S. Mahmoodian, M. Mahdian and Frank Harary.
  46. Hypergraphical codes arising from binary trades. Designs, Codes and Cryptography 18(1-3) (1999) 183-186. With G.B. Khosrovshahi. [DOI]
  47. On compressing complete designs. Journal of Statistical Planning and Inference 74(1) (1998)193-201. With G.B. Khosrovshahi. [DOI]
  48. Defining sets in vertex coloring of graphs and Latin Rectangles. Discrete Mathematics 167/168 (1997) 451-460. With E.S. Mahmoodian, M. Zaker. [DOI]