|
|
Complement Avoidance in Binary Words
James Currie
,
Lubomíra Dvoraková
,
Pascal Ochem
,
Daniela Opočenská
,
Narad Rampersad
et al.
The Electronic Journal of Combinatorics, 2025, 32 (4), pp.4.24. ⟨10.37236/11555⟩
Article dans une revue
lirmm-05326572v1
|
|
|
Acyclic, star and injective colouring: A complexity picture for H-free graphs
Jan Bok
,
Nikola Jedličková
,
Barnaby Martin
,
Pascal Ochem
,
Daniël Paulusma
et al.
Article dans une revue
lirmm-05124700v1
|
|
|
Words avoiding the morphic images of most of their factors
Pascal Ochem
,
Matthieu Rosenfeld
Article dans une revue
lirmm-05326624v1
|
|
|
4-tangrams are 4-avoidable
Pascal Ochem
,
Théo Pierron
Article dans une revue
lirmm-05154498v1
|
|
|
Contact graphs of boxes with unidirectional contacts
Daniel Gonçalves
,
Vincent Limouzy
,
Pascal Ochem
Discrete Mathematics and Theoretical Computer Science, 2024, 25 (3 (special issue ICGT'22)), ⟨10.46298/dmtcs.10805⟩
Article dans une revue
lirmm-04659843v1
|
|
|
Critical Exponent of Binary Words with Few Distinct Palindromes
L’ubomíra Dvoraková
,
Pascal Ochem
,
Daniela Opočenská
The Electronic Journal of Combinatorics, 2024, 31 (2), pp.P2.29. ⟨10.37236/12574⟩
Article dans une revue
lirmm-04659827v1
|
|
|
Antisquares and Critical Exponents
Aseem Baranwal
,
James Currie
,
Lucas Mol
,
Pascal Ochem
,
Narad Rampersad
et al.
Article dans une revue
lirmm-03799689v2
|
|
|
Properties of a ternary infinite word
James Currie
,
Pascal Ochem
,
Narad Rampersad
,
Jeffrey Shallit
Article dans une revue
lirmm-04028901v1
|
|
|
On ternary Dejean words avoiding 010
Pascal Ochem
Article dans une revue
hal-04241523v1
|
|
|
Pseudoperiodic Words and a Question of Shevelev
Joseph Meleshko
,
Pascal Ochem
,
Jeffrey Shallit
,
Sonja Linghui Shan
Discrete Mathematics and Theoretical Computer Science, 2023, 25:2 (Automata, Logic and Semantics), ⟨10.46298/dmtcs.9919⟩
Article dans une revue
hal-04244909v1
|
|
|
Doubled Patterns with Reversal and Square-Free Doubled Patterns
Antoine Domenech
,
Pascal Ochem
Article dans une revue
hal-04241511v1
|
|
|
Avoiding square-free words on free groups
Golnaz Badkobeh
,
Tero Harju
,
Pascal Ochem
,
Matthieu Rosenfeld
Article dans une revue
hal-03751878v1
|
|
|
Acyclic, Star, and Injective Colouring: Bounding the Diameter
Christoph Brause
,
Petr Golovach
,
Barnaby Martin
,
Pascal Ochem
,
Daniël Paulusma
et al.
The Electronic Journal of Combinatorics, 2022, 29 (2), pp.#P2.43. ⟨10.37236/10738⟩
Article dans une revue
lirmm-03799962v1
|
|
|
A family of formulas with reversal of arbitrarily high avoidability index
Pascal Ochem
Article dans une revue
lirmm-03405898v1
|
|
|
Homomorphisms of planar $(m,n)$-colored-mixed graphs to planar targets
Fabien Jacques
,
Pascal Ochem
Article dans une revue
lirmm-03371159v1
|
|
|
Avoidability of Palindrome Patterns
Pascal Ochem
,
Matthieu Rosenfeld
The Electronic Journal of Combinatorics, 2021, 28 (1), pp.#1.4. ⟨10.37236/9593⟩
Article dans une revue
lirmm-03371500v1
|
|
|
On non-repetitive sequences of arithmetic progressions: The cases k ∈ { 4 , 5 , 6 , 7 , 8 }
Borut Lužar
,
Martina Mockovčiaková
,
Pascal Ochem
,
Alexandre Pinlou
,
Roman Sotak
Article dans une revue
lirmm-02349883v1
|
|
|
Complexity of planar signed graph homomorphisms to cycles
François Dross
,
Florent Foucaud
,
Valia Mitsou
,
Pascal Ochem
,
Théo Pierron
Article dans une revue
hal-02990576v1
|
|
|
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi
,
François Dross
,
Pascal Ochem
Article dans une revue
hal-02990588v1
|
|
|
Oriented cliques and colorings of graphs with low maximum degree
Janusz Dybizbański
,
Pascal Ochem
,
Alexandre Pinlou
,
Andrzej Szepietowski
Article dans une revue
lirmm-02938614v1
|
|
|
Avoiding conjugacy classes on the 5-letter alphabet
Golnaz Badkobeh
,
Pascal Ochem
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2020, 54 (2), pp.1-4. ⟨10.1051/ita/2020003⟩
Article dans une revue
hal-02903902v1
|
|
|
Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs
François Dross
,
Pascal Ochem
Article dans une revue
hal-02990467v1
|
|
|
On some interesting ternary formulas
Pascal Ochem
,
Matthieu Rosenfeld
The Electronic Journal of Combinatorics, 2019, 26 (1), pp.P1.12. ⟨10.37236/7901⟩
Article dans une revue
lirmm-02083616v1
|
|
|
On the Kőnig-Egerváry theorem for $k$-paths
Stéphane Bessy
,
Pascal Ochem
,
Dieter Rautenbach
Article dans une revue
lirmm-02078255v1
|
|
|
Oriented incidence colourings of digraphs
Christopher Duffy
,
Gary Macgillivray
,
Pascal Ochem
,
André Raspaud
Article dans une revue
lirmm-02011333v1
|
|
|
Repetition avoidance in products of factors
Pamela Fleischmann
,
Pascal Ochem
,
Kamellia Reshadi
Article dans une revue
lirmm-02500480v1
|
|
|
Some further results on squarefree arithmetic progressions in infinite words
James Currie
,
Tero Harju
,
Pascal Ochem
,
Narad Rampersad
Article dans une revue
lirmm-02349876v1
|
|
|
Avoidability of circular formulas
Guilhem Gamard
,
Pascal Ochem
,
Gwenaël Richomme
,
Patrice Séébold
Article dans une revue
lirmm-01692716v1
|
|
|
On repetition thresholds of caterpillars and trees of bounded degree
Borut Lužar
,
Pascal Ochem
,
Alexandre Pinlou
The Electronic Journal of Combinatorics, 2018, 25 (1), pp.#P1.61. ⟨10.37236/6793⟩
Article dans une revue
lirmm-01730276v1
|
|
|
Homomorphisms of 2-edge-colored triangle-free planar graphs
Pascal Ochem
,
Alexandre Pinlou
,
Sagnik Sen
Article dans une revue
lirmm-01376130v1
|
|
|
The complexity of partitioning into disjoint cliques and a triangle-free graph
Marin Bougeret
,
Pascal Ochem
Article dans une revue
lirmm-02078169v1
|
|
|
Avoidability of Formulas with Two Variables
Pascal Ochem
,
Matthieu Rosenfeld
The Electronic Journal of Combinatorics, 2017, 24 (4), pp.#P4.30. ⟨10.37236/6536⟩
Article dans une revue
lirmm-01897592v1
|
|
|
2-subcoloring is NP-complete for planar comparability graphs
Pascal Ochem
Article dans une revue
lirmm-01692394v1
|
|
|
Bounds on the exponential domination number
Stéphane Bessy
,
Pascal Ochem
,
Dieter Rautenbach
Article dans une revue
lirmm-01692753v1
|
|
|
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms
Nazanin Movarraei
,
Pascal Ochem
Article dans une revue
lirmm-02083721v1
|
|
|
Doubled patterns are 3-avoidable
Pascal Ochem
The Electronic Journal of Combinatorics, 2016, 23 (1), pp.P1.19. ⟨10.37236/5618⟩
Article dans une revue
lirmm-01375763v1
|
|
|
On interval representations of graphs
Aquiles Braga de Queiroz
,
Valentin Garnero
,
Pascal Ochem
Article dans une revue
lirmm-01348411v1
|
|
|
A short proof that shuffle squares are 7-avoidable
Guillaume Guégan
,
Pascal Ochem
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2016, 50 (1), pp.101-103. ⟨10.1051/ita/2016007⟩
Article dans une revue
istex
lirmm-01347424v1
|
|
|
Exponential Domination in Subcubic Graphs
Stéphane Bessy
,
Pascal Ochem
,
Dieter Rautenbach
The Electronic Journal of Combinatorics, 2016, 23 (4), pp.#P4.42. ⟨10.37236/5711⟩
Article dans une revue
lirmm-01997215v1
|
|
|
Islands in graphs on surfaces
Louis Esperet
,
Pascal Ochem
Article dans une revue
hal-01119804v1
|
|
|
Characterization of some binary words with few squares
Golnaz Badkobeh
,
Pascal Ochem
Article dans une revue
lirmm-01263844v1
|
|
|
Near-colorings: non-colorable graphs and NP-completeness
Mickaël Montassier
,
Pascal Ochem
The Electronic Journal of Combinatorics, 2015, 22 (1), pp.#P1.57. ⟨10.37236/3509⟩
Article dans une revue
lirmm-01263770v1
|
|
|
Complexity dichotomy for oriented homomorphism of planar graphs with large girth
Guillaume Guégan
,
Pascal Ochem
Article dans une revue
lirmm-01263869v1
|
|
|
The Maximum Clique Problem in Multiple Interval Graphs
Mathew C. Francis
,
Daniel Gonçalves
,
Pascal Ochem
Article dans une revue
lirmm-01263898v1
|
|
|
Application of entropy compression in pattern avoidance
Pascal Ochem
,
Alexandre Pinlou
The Electronic Journal of Combinatorics, 2014, 21 (2), pp.1-12. ⟨10.37236/3038⟩
Article dans une revue
lirmm-01233448v1
|
|
|
Binary patterns in binary cube-free words: Avoidability and growth
Robert Mercaş
,
Pascal Ochem
,
Alexey V. Samsonov
,
Arseny M. Shur
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2014, 48 (4), pp.369-389. ⟨10.1051/ita/2014015⟩
Article dans une revue
lirmm-01263848v1
|
|
|
Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
Pascal Ochem
,
Alexandre Pinlou
Article dans une revue
lirmm-00780910v1
|
|
|
Another remark on the radical of an ODD perfect number
Pascal Ochem
,
Michaël Rao
The Fibonacci Quarterly, 2014, 52 (3), pp.215-217
Article dans une revue
lirmm-01349855v1
|
|
|
On the number of prime factors of an odd perfect number
Pascal Ochem
,
Michael Rao
Article dans une revue
lirmm-01263897v1
|
|
|
More on square-free words obtained from prefixes by permutations
Pascal Ochem
Fundamenta Informaticae, 2014, Russian-Finnish Symposium in Discrete Mathematics, 132 (1), pp.109-112. ⟨10.3233/FI-2014-1035⟩
Article dans une revue
lirmm-01375793v1
|
|
|
Vertex Partitions of Graphs into Cographs and Stars
Paul Dorbec
,
Mickael Montassier
,
Pascal Ochem
Article dans une revue
istex
hal-00911272v1
|
|
|
Strong edge-colouring and induced matchings
Hervé Hocquard
,
Pascal Ochem
,
Petru Valicov
Article dans une revue
hal-00609454v4
|
|
|
A Complexity Dichotomy for the Coloring of Sparse Graphs
Louis Esperet
,
Mickaël Montassier
,
Pascal Ochem
,
Alexandre Pinlou
Article dans une revue
istex
lirmm-00736468v1
|
|
|
Sieve Methods for Odd Perfect Numbers
S. Adam Fletcher
,
P. Nielsen Pace
,
Pascal Ochem
Article dans une revue
lirmm-00739250v1
|
|
|
Repetition Thresholds for Subdivided Graphs and Trees
Pascal Ochem
,
Elise Vaslet
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2012, 46 (1), pp.123-130. ⟨10.1051/ita/2011122⟩
Article dans une revue
istex
lirmm-00739384v1
|
|
|
Locally identifying coloring of graphs
Louis Esperet
,
Sylvain Gravier
,
Mickael Montassier
,
Pascal Ochem
,
Aline Parreau
The Electronic Journal of Combinatorics, 2012, 19 (2), pp.40. ⟨10.37236/2417⟩
Article dans une revue
hal-00529640v2
|
|
|
Odd Perfect Numbers are Greater than 10^1500
Pascal Ochem
,
Michael Rao
Article dans une revue
lirmm-00739245v1
|
|
|
Thue choosability of trees
Francesca Fiorenzi
,
Pascal Ochem
,
Patrice Ossona de Mendez
,
Xuding Zhu
Article dans une revue
istex
hal-00656797v1
|
|
|
Bounds for the Generalized Repetition Threshold
Francesca Fiorenzi
,
Pascal Ochem
,
Elise Vaslet
Article dans une revue
istex
lirmm-00739391v1
|
|
|
Planar Graphs Have 1-string Representations
Jérémie Chalopin
,
Daniel Gonçalves
,
Pascal Ochem
Article dans une revue
lirmm-00433091v1
|
|
|
Homomorphisms of 2-edge-colored graphs
Amanda Montejano
,
Pascal Ochem
,
Alexandre Pinlou
,
André Raspaud
,
Eric Sopena
Article dans une revue
istex
lirmm-00433039v1
|
|
|
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
O.V. Borodin
,
A.O. Ivanova
,
Mickael Montassier
,
Pascal Ochem
,
André Raspaud
Article dans une revue
hal-00377372v1
|
|
|
On circle graphs with girth at least five
Louis Esperet
,
Pascal Ochem
Discrete Mathematics, 2009, 309 (8), pp.2217-2222
Article dans une revue
hal-00451863v1
|
|
|
On Star and Caterpillar Arboricity
Daniel Gonçalves
,
Pascal Ochem
Article dans une revue
istex
lirmm-00338327v1
|
|
|
Dejean's conjecture and letter frequency
Jérémie Chalopin
,
Pascal Ochem
RAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, pp.477-480. ⟨10.1051/ita:2008013⟩
Article dans une revue
hal-00432200v1
|
|
|
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
Mickaël Montassier
,
Pascal Ochem
,
Alexandre Pinlou
Discrete Mathematics and Theoretical Computer Science, 2008, Vol. 10 no. 1 (1), pp.1-24. ⟨10.46298/dmtcs.418⟩
Article dans une revue
lirmm-00184811v1
|
|
|
Oriented Colorings of Partial 2-trees
Pascal Ochem
,
Alexandre Pinlou
Article dans une revue
istex
lirmm-00314715v1
|
|
|
On induced-universal graphs for the class of bounded-degree graphs
Louis Esperet
,
Arnaud Labourel
,
Pascal Ochem
Article dans une revue
hal-00368277v1
|
|
|
On the Oriented Chromatic Index of Oriented Graphs
Pascal Ochem
,
Alexandre Pinlou
,
Eric Sopena
Article dans une revue
istex
lirmm-00195956v1
|
|
|
Oriented coloring of 2-outerplanar graphs
Louis Esperet
,
Pascal Ochem
Information Processing Letters, 2007, 101, pp.215--219
Article dans une revue
hal-00307156v1
|
|
|
On the acyclic choosability of graphs
Mickael Montassier
,
Pascal Ochem
,
André Raspaud
Journal of Graph Theory, 2006, 51, pp.281--300
Article dans une revue
hal-00307137v1
|
|
|
Oriented colorings of triangle-free planar graphs
Pascal Ochem
Information Processing Letters, 2004, 92, pp.71-76
Article dans une revue
hal-00307124v1
|
|
|
On the interval number of special graphs
József Balogh
,
Pascal Ochem
,
András Pluhár
Journal of Graph Theory, 2004, 46 (4), pp.241-253
Article dans une revue
hal-00307641v1
|
|
|
How many square occurrences must a binary sequence contain?
Gregory Kucherov
,
Pascal Ochem
,
Michael Rao
The Electronic Journal of Combinatorics, 2003, 10 (1), 11 p. ⟨10.37236/1705⟩
Article dans une revue
inria-00099596v1
|
|
|
How Many Square Occurrences Must a Binary Sequence Contain?
Gregory Kucherov
,
Pascal Ochem
,
Michael Rao
The Electronic Journal of Combinatorics, 2003, 10, pp.R12
Article dans une revue
hal-00307205v1
|