Pascal Ochem

Theor. Comput. Sci., 2026

2025

Acyclic, star and injective colouring: A complexity picture for H-free graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2025

Words avoiding the morphic images of most of their factors.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2025

4-tangrams are 4-avoidable.

[BibT_eX]

[DOI]

Théo Pierron

Discret. Math. Theor. Comput. Sci., 2025

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2025

2024

Critical Exponent of Binary Words with Few Distinct Palindromes.

[BibT_eX]

[DOI]

L'ubomíra Dvoráková

Daniela Opocenská

Electron. J. Comb., 2024

2023

Properties of a ternary infinite word.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2023

Pseudoperiodic Words and a Question of Shevelev.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2023

Antisquares and Critical Exponents.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2023

Contact graphs of boxes with unidirectional contacts.

[BibT_eX]

[DOI]

Vincent Limouzy

Discret. Math. Theor. Comput. Sci., 2023

Doubled Patterns with Reversal and Square-Free Doubled Patterns.

[BibT_eX]

[DOI]

Antoine Domenech

Electron. J. Comb., 2023

2022

Avoiding square-free words on free groups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Complement Avoidance in Binary Words.

[BibT_eX]

[DOI]

CoRR, 2022

Acyclic, Star, and Injective Colouring: Bounding the Diameter.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

2021

A family of formulas with reversal of arbitrarily high avoidability index.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Homomorphisms of planar (m, n)-colored-mixed graphs to planar targets.

[BibT_eX]

[DOI]

Fabien Jacques

Discret. Math., 2021

Avoidability of Palindrome Patterns.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Doubled Patterns with Reversal Are 3-Avoidable.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020

Avoiding conjugacy classes on the 5-letter alphabet.

[BibT_eX]

[DOI]

Golnaz Badkobeh

RAIRO Theor. Informatics Appl., 2020

Oriented cliques and colorings of graphs with low maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2020

Partitioning sparse graphs into an independent set and a graph with bounded size components.

[BibT_eX]

[DOI]

Ilkyoo Choi

François Dross

Discret. Math., 2020

On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}.

[BibT_eX]

[DOI]

Borut Luzar

Martina Mockovciaková

Roman Soták

Discret. Appl. Math., 2020

Complexity of planar signed graph homomorphisms to cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

Repetition avoidance in products of factors.

[BibT_eX]

[DOI]

Pamela Fleischmann

Kamellia Reshadi

Theor. Comput. Sci., 2019

Some further results on squarefree arithmetic progressions in infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

On the Kőnig?Egerváry theorem for k?paths.

[BibT_eX]

[DOI]

Stéphane Bessy

Dieter Rautenbach

J. Graph Theory, 2019

Oriented incidence colourings of digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2019

Vertex partitions of (C3, C4, C6)-free planar graphs.

[BibT_eX]

[DOI]

François Dross

Discret. Math., 2019

Oriented coloring of graphs with low maximum degree.

[BibT_eX]

[DOI]

CoRR, 2019

New Results on Pseudosquare Avoidance.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Evitement de motif.

[BibT_eX]

[DOI]

, 2019

2018

Avoidability of circular formulas.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

On Repetition Thresholds of Caterpillars and Trees of Bounded Degree.

[BibT_eX]

[DOI]

Borut Luzar

Electron. J. Comb., 2018

2017

Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.

[BibT_eX]

[DOI]

Sagnik Sen

J. Graph Theory, 2017

Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms.

[BibT_eX]

[DOI]

Nazanin Movarraei

Inf. Process. Lett., 2017

2-subcoloring is NP-complete for planar comparability graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2017

Bounds on the exponential domination number.

[BibT_eX]

[DOI]

Stéphane Bessy

Dieter Rautenbach

Discret. Math., 2017

The complexity of partitioning into disjoint cliques and a triangle-free graph.

[BibT_eX]

[DOI]

Marin Bougeret

Discret. Appl. Math., 2017

Vertex partitions of (C3, C4, C6)-free planar graphs.

[BibT_eX]

[DOI]

François Dross

CoRR, 2017

On Some Interesting Ternary Formulas.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2016

Islands in Graphs on Surfaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

A short proof that shuffle squares are 7-avoidable.

[BibT_eX]

[DOI]

Guillaume Guégan

RAIRO Theor. Informatics Appl., 2016

On interval representations of graphs.

[BibT_eX]

[DOI]

Aquiles Braga de Queiroz

Valentin Garnero

Discret. Appl. Math., 2016

Doubled Patterns are 3-Avoidable.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Exponential Domination in Subcubic Graphs.

[BibT_eX]

[DOI]

Stéphane Bessy

Dieter Rautenbach

Electron. J. Comb., 2016

Avoidability of Formulas with Two Variables.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Complexity dichotomy for oriented homomorphism of planar graphs with large girth.

[BibT_eX]

[DOI]

Guillaume Guégan

Theor. Comput. Sci., 2015

Characterization of some binary words with few squares.

[BibT_eX]

[DOI]

Golnaz Badkobeh

Theor. Comput. Sci., 2015

Near-Colorings: Non-Colorable Graphs and NP-Completeness.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

The Maximum Clique Problem in Multiple Interval Graphs.

[BibT_eX]

[DOI]

Mathew C. Francis

Algorithmica, 2015

2014

On the number of prime factors of an odd perfect number.

[BibT_eX]

[DOI]

Michaël Rao

Math. Comput., 2014

Vertex Partitions of Graphs into Cographs and Stars.

[BibT_eX]

[DOI]

Paul Dorbec

J. Graph Theory, 2014

Binary patterns in binary cube-free words: Avoidability and growth.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

More on Square-free Words Obtained from Prefixes by Permutations.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2014

Homomorphisms of signed planar graphs.

[BibT_eX]

[DOI]

Sagnik Sen

CoRR, 2014

Application of Entropy Compression in Pattern Avoidance.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

2013

A Complexity Dichotomy for the Coloring of Sparse Graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2013

Strong edge-colouring and induced matchings.

[BibT_eX]

[DOI]

Hervé Hocquard

Petru Valicov

Inf. Process. Lett., 2013

2012

Odd perfect numbers are greater than 101500.

[BibT_eX]

[DOI]

Michaël Rao

Math. Comput., 2012

Sieve methods for odd perfect numbers.

[BibT_eX]

[DOI]

S. Adam Fletcher

Pace P. Nielsen

Math. Comput., 2012

Repetition thresholds for subdivided graphs and trees.

[BibT_eX]

[DOI]

Elise Vaslet

RAIRO Theor. Informatics Appl., 2012

Locally Identifying Coloring of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Mathew C. Francis

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

Bounds for the generalized repetition threshold.

[BibT_eX]

[DOI]

Francesca Fiorenzi

Elise Vaslet

Theor. Comput. Sci., 2011

Bounds and complexity results for strong edge colouring of subcubic graphs.

[BibT_eX]

[DOI]

Hervé Hocquard

Petru Valicov

Electron. Notes Discret. Math., 2011

Thue choosability of trees.

[BibT_eX]

[DOI]

Francesca Fiorenzi

Patrice Ossona de Mendez

Xuding Zhu

Discret. Appl. Math., 2011

2010

Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k.

[BibT_eX]

[DOI]

J. Graph Theory, 2010

Binary words avoiding the pattern AABBCABBA.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

On maximal repetitions of arbitrary exponent.

[BibT_eX]

[DOI]

Roman Kolpakov

Gregory Kucherov

Inf. Process. Lett., 2010

Planar Graphs Have 1-string Representations.

[BibT_eX]

[DOI]

Jérémie Chalopin

Discret. Comput. Geom., 2010

2009

On star and caterpillar arboricity.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

On the oriented chromatic index of oriented graphs.

[BibT_eX]

[DOI]

Éric Sopena

J. Graph Theory, 2008

Oriented colorings of partial 2-trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

On induced-universal graphs for the class of bounded-degree graphs.

[BibT_eX]

[DOI]

Arnaud Labourel

Inf. Process. Lett., 2008

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Narad Rampersad

Jeffrey O. Shallit

Int. J. Found. Comput. Sci., 2008

Homomorphisms of 2-edge-colored graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Strong oriented chromatic number of planar graphs without cycles of specific lengths.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2008

2007

Letter frequency in infinite repetition-free words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Oriented colorings of 2-outerplanar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Oriented vertex and arc colorings of partial 2-trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

On circle graphs with girth at least five.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Dejean's conjecture and letter frequency.

[BibT_eX]

[DOI]

Jérémie Chalopin

Electron. Notes Discret. Math., 2007

Planar graphs are in 1-STRING.

[BibT_eX]

[DOI]

Jérémie Chalopin

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Avoiding Approximate Squares.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006

On the acyclic choosability of graphs.

[BibT_eX]

[DOI]

André Raspaud

J. Graph Theory, 2006

A generator of morphisms for infinite words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

2005

On some arboricities in planar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2004

On the interval number of special graphs.

[BibT_eX]

[DOI]

József Balogh

András Pluhár

J. Graph Theory, 2004

Oriented colorings of triangle-free planar graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

A Generalization of Repetition Threshold.

[BibT_eX]

[DOI]

Lucian Ilie

Jeffrey O. Shallit

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

How Many Square Occurrences Must a Binary Sequence Contain?

[BibT_eX]

[DOI]

Gregory Kucherov