Pascal Ochem
Pascal Ochem
LIRMM - CNRS
Подтвержден адрес электронной почты в домене lirmm.fr - Главная страница
НазваниеПроцитированоГод
A generator of morphisms for infinite words
P Ochem
RAIRO-Theoretical Informatics and Applications 40 (3), 427-441, 2006
582006
Odd perfect numbers are greater than 10¹⁵⁰⁰
P Ochem, M Rao
Mathematics of Computation 81 (279), 1869-1877, 2012
492012
On the acyclic choosability of graphs
M Montassier, P Ochem, A Raspaud
Journal of Graph Theory 51 (4), 281-300, 2006
382006
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
372010
Oriented colorings of triangle-free planar graphs
P Ochem
Information Processing Letters 92 (2), 71-76, 2004
352004
A generalization of repetition threshold
L Ilie, P Ochem, J Shallit
Theoretical computer science 345 (2-3), 359-369, 2005
332005
Thue choosability of trees
F Fiorenzi, P Ochem, PO De Mendez, X Zhu
Discrete Applied Mathematics 159 (17), 2045-2049, 2011
262011
Planar graphs have 1-string representations
J Chalopin, D Gonçalves, P Ochem
Discrete & Computational Geometry 43 (3), 626-647, 2010
262010
Oriented colorings of 2-outerplanar graphs
L Esperet, P Ochem
Information Processing Letters 101 (5), 215-219, 2007
252007
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
242006
Negative results on acyclic improper colorings
P Ochem
European Conference on Combinatorics (EuroComb 2005), 357-362, 2005
242005
Planar graphs are in 1-STRING
J Chalopin, D Gonçalves, P Ochem
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
232007
Strong edge-colouring and induced matchings
H Hocquard, P Ochem, P Valicov
Information Processing Letters 113 (19-21), 836-843, 2013
222013
Near-colorings: non-colorable graphs and NP-completeness
M Montassier, P Ochem
arXiv preprint arXiv:1306.0752, 2013
222013
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
192013
Locally identifying coloring of graphs
L Esperet, S Gravier, MÃ Montassier, P Ochem, A Parreau
the electronic journal of combinatorics 19 (2), P40, 2012
192012
Oriented colorings of partial 2-trees
P Ochem, A Pinlou
Information Processing Letters 108 (2), 82-86, 2008
192008
Letter frequency in infinite repetition-free words
P Ochem
Theoretical computer science 380 (3), 388-392, 2007
192007
Islands in graphs on surfaces
L Esperet, P Ochem
SIAM Journal on Discrete Mathematics 30 (1), 206-219, 2016
182016
Application of entropy compression in pattern avoidance
P Ochem, A Pinlou
arXiv preprint arXiv:1301.1873, 2013
172013
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20