Odd perfect numbers are greater than 10¹⁵⁰⁰ P Ochem, M Rao Mathematics of Computation 81 (279), 1869-1877, 2012 | 96 | 2012 |

A generator of morphisms for infinite words P Ochem RAIRO-Theoretical Informatics and Applications 40 (3), 427-441, 2006 | 70 | 2006 |

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most *k*OV Borodin, AO Ivanova, M Montassier, P Ochem, A Raspaud Journal of Graph Theory 65 (2), 83-93, 2010 | 45 | 2010 |

Oriented colorings of triangle-free planar graphs P Ochem Information Processing Letters 92 (2), 71-76, 2004 | 39 | 2004 |

On the acyclic choosability of graphs M Montassier, P Ochem, A Raspaud Journal of Graph Theory 51 (4), 281-300, 2006 | 38 | 2006 |

Thue choosability of trees F Fiorenzi, P Ochem, PO De Mendez, X Zhu Discrete Applied Mathematics 159 (17), 2045-2049, 2011 | 35 | 2011 |

A generalization of repetition threshold L Ilie, P Ochem, J Shallit Theoretical computer science 345 (2-3), 359-369, 2005 | 34 | 2005 |

Planar graphs have 1-string representations J Chalopin, D Gonçalves, P Ochem Discrete & Computational Geometry 43 (3), 626-647, 2010 | 32 | 2010 |

Homomorphisms of 2-edge-colored graphs A Montejano, P Ochem, A Pinlou, A Raspaud, É Sopena Discrete Applied Mathematics 158 (12), 1365-1379, 2010 | 31 | 2010 |

Oriented colorings of 2-outerplanar graphs L Esperet, P Ochem Information Processing Letters 101 (5), 215-219, 2007 | 30 | 2007 |

Near-colorings: non-colorable graphs and NP-completeness M Montassier, P Ochem arXiv preprint arXiv:1306.0752, 2013 | 28 | 2013 |

Planar graphs are in 1-STRING J Chalopin, D Gonçalves, P Ochem Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007 | 28 | 2007 |

A complexity dichotomy for the coloring of sparse graphs L Esperet, M Montassier, P Ochem, A Pinlou Journal of Graph Theory 73 (1), 85-102, 2013 | 27 | 2013 |

Upper bound on the number of ternary square-free words P Ochem, T Reix Proceedings of Workshop on Words and Automata (WOWA’06)(St Petersburg, 2006 | 26 | 2006 |

Negative results on acyclic improper colorings P Ochem Discrete Mathematics and Theoretical Computer Science, 357-362, 2005 | 26 | 2005 |

Strong edge-colouring and induced matchings H Hocquard, P Ochem, P Valicov Information Processing Letters 113 (19-21), 836-843, 2013 | 25 | 2013 |

On induced-universal graphs for the class of bounded-degree graphs L Esperet, A Labourel, P Ochem Information Processing Letters 108 (5), 255-260, 2008 | 25 | 2008 |

Application of entropy compression in pattern avoidance P Ochem, A Pinlou arXiv preprint arXiv:1301.1873, 2013 | 24 | 2013 |

Oriented colorings of partial 2-trees P Ochem, A Pinlou Information Processing Letters 108 (2), 82-86, 2008 | 23 | 2008 |

Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs P Ochem, A Pinlou, S Sen Journal of Graph Theory 85 (1), 258-277, 2017 | 22 | 2017 |