Pascal Ochem
Pascal Ochem
LIRMM - CNRS
Подтвержден адрес электронной почты в домене lirmm.fr - Главная страница
Название
Процитировано
Процитировано
Год
Odd perfect numbers are greater than 10¹⁵⁰⁰
P Ochem, M Rao
Mathematics of Computation 81 (279), 1869-1877, 2012
612012
A generator of morphisms for infinite words
P Ochem
RAIRO-Theoretical Informatics and Applications 40 (3), 427-441, 2006
612006
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
432010
Oriented colorings of triangle-free planar graphs
P Ochem
Information Processing Letters 92 (2), 71-76, 2004
392004
On the acyclic choosability of graphs
M Montassier, P Ochem, A Raspaud
Journal of Graph Theory 51 (4), 281-300, 2006
372006
Thue choosability of trees
F Fiorenzi, P Ochem, PO De Mendez, X Zhu
Discrete Applied Mathematics 159 (17), 2045-2049, 2011
332011
A generalization of repetition threshold
L Ilie, P Ochem, J Shallit
Theoretical computer science 345 (2-3), 359-369, 2005
332005
Planar graphs have 1-string representations
J Chalopin, D Gonçalves, P Ochem
Discrete & Computational Geometry 43 (3), 626-647, 2010
282010
Oriented colorings of 2-outerplanar graphs
L Esperet, P Ochem
Information Processing Letters 101 (5), 215-219, 2007
282007
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
272006
Near-colorings: non-colorable graphs and NP-completeness
M Montassier, P Ochem
arXiv preprint arXiv:1306.0752, 2013
262013
Planar graphs are in 1-STRING
J Chalopin, D Gonçalves, P Ochem
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
262007
Negative results on acyclic improper colorings
P Ochem
252005
Homomorphisms of 2-edge-colored graphs
A Montejano, P Ochem, A Pinlou, A Raspaud, E Sopena
Discrete Applied Mathematics 158 (12), 1365-1379, 2010
242010
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
232013
Application of entropy compression in pattern avoidance
P Ochem, A Pinlou
arXiv preprint arXiv:1301.1873, 2013
232013
Strong edge-colouring and induced matchings
H Hocquard, P Ochem, P Valicov
Information Processing Letters 113 (19-21), 836-843, 2013
222013
Islands in graphs on surfaces
L Esperet, P Ochem
SIAM Journal on Discrete Mathematics 30 (1), 206-219, 2016
202016
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
202008
Letter frequency in infinite repetition-free words
P Ochem
Theoretical computer science 380 (3), 388-392, 2007
202007
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20