2023
Properties of a ternary infinite word.
RAIRO Theor. Informatics Appl., 2023
Critical exponent of binary words with few distinct palindromes.
CoRR, 2023
Contact graphs of boxes with unidirectional contacts.
CoRR, 2023
Doubled Patterns with Reversal and Square-Free Doubled Patterns.
Electron. J. Comb., 2023
2022
Avoiding square-free words on free groups.
Theor. Comput. Sci., 2022
Complement Avoidance in Binary Words.
CoRR, 2022
Antisquares and Critical Exponents.
CoRR, 2022
Pseudoperiodic Words and a Question of Shevelev.
CoRR, 2022
Acyclic, Star, and Injective Colouring: Bounding the Diameter.
Electron. J. Comb., 2022
2021
A family of formulas with reversal of arbitrarily high avoidability index.
Theor. Comput. Sci., 2021
Homomorphisms of planar (<i>m</i>, <i>n</i>)-colored-mixed graphs to planar targets.
Discret. Math., 2021
Avoidability of Palindrome Patterns.
Electron. J. Comb., 2021
Doubled Patterns with Reversal Are 3-Avoidable.
Proceedings of the Combinatorics on Words - 13th International Conference, 2021
2020
Avoiding conjugacy classes on the 5-letter alphabet.
RAIRO Theor. Informatics Appl., 2020
Oriented cliques and colorings of graphs with low maximum degree.
Discret. Math., 2020
Partitioning sparse graphs into an independent set and a graph with bounded size components.
Discret. Math., 2020
On non-repetitive sequences of arithmetic progressions: The cases k∈{4, 5, 6, 7, 8}.
Discret. Appl. Math., 2020
Complexity of planar signed graph homomorphisms to cycles.
Discret. Appl. Math., 2020
2019
Repetition avoidance in products of factors.
Theor. Comput. Sci., 2019
Some further results on squarefree arithmetic progressions in infinite words.
Theor. Comput. Sci., 2019
On the Kőnig?Egerváry theorem for k?paths.
J. Graph Theory, 2019
Oriented incidence colourings of digraphs.
Discuss. Math. Graph Theory, 2019
Vertex partitions of (C3, C4, C6)-free planar graphs.
Discret. Math., 2019
Oriented coloring of graphs with low maximum degree.
CoRR, 2019
On Some Interesting Ternary Formulas.
Electron. J. Comb., 2019
New Results on Pseudosquare Avoidance.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019
2018
Avoidability of circular formulas.
Theor. Comput. Sci., 2018
On Repetition Thresholds of Caterpillars and Trees of Bounded Degree.
Electron. J. Comb., 2018
2017
Homomorphisms of 2-Edge-Colored Triangle-Free Planar Graphs.
J. Graph Theory, 2017
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms.
Inf. Process. Lett., 2017
2-subcoloring is NP-complete for planar comparability graphs.
Inf. Process. Lett., 2017
Bounds on the exponential domination number.
Discret. Math., 2017
The complexity of partitioning into disjoint cliques and a triangle-free graph.
Discret. Appl. Math., 2017
Vertex partitions of (C<sub>3</sub>, C<sub>4</sub>, C<sub>6</sub>)-free planar graphs.
CoRR, 2017
Avoidability of Formulas with Two Variables.
Electron. J. Comb., 2017
2016
Islands in Graphs on Surfaces.
SIAM J. Discret. Math., 2016
A short proof that shuffle squares are 7-avoidable.
RAIRO Theor. Informatics Appl., 2016
On interval representations of graphs.
Discret. Appl. Math., 2016
Doubled Patterns are 3-Avoidable.
Electron. J. Comb., 2016
Exponential Domination in Subcubic Graphs.
Electron. J. Comb., 2016
2015
Complexity dichotomy for oriented homomorphism of planar graphs with large girth.
Theor. Comput. Sci., 2015
Characterization of some binary words with few squares.
Theor. Comput. Sci., 2015
Near-Colorings: Non-Colorable Graphs and NP-Completeness.
Electron. J. Comb., 2015
The Maximum Clique Problem in Multiple Interval Graphs.
Algorithmica, 2015
2014
On the number of prime factors of an odd perfect number.
Math. Comput., 2014
Vertex Partitions of Graphs into Cographs and Stars.
J. Graph Theory, 2014
Binary patterns in binary cube-free words: Avoidability and growth.
RAIRO Theor. Informatics Appl., 2014
More on Square-free Words Obtained from Prefixes by Permutations.
Fundam. Informaticae, 2014
Homomorphisms of signed planar graphs.
CoRR, 2014
Application of Entropy Compression in Pattern Avoidance.
Electron. J. Comb., 2014
2013
A Complexity Dichotomy for the Coloring of Sparse Graphs.
J. Graph Theory, 2013
Strong edge-colouring and induced matchings.
Inf. Process. Lett., 2013
2012
Odd perfect numbers are greater than 10<sup>1500</sup>.
Math. Comput., 2012
Sieve methods for odd perfect numbers.
Math. Comput., 2012
Repetition thresholds for subdivided graphs and trees.
RAIRO Theor. Informatics Appl., 2012
Locally Identifying Coloring of Graphs.
Electron. J. Comb., 2012
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012
2011
Bounds for the generalized repetition threshold.
Theor. Comput. Sci., 2011
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs.
Electron. Notes Discret. Math., 2011
Bounds and complexity results for strong edge colouring of subcubic graphs.
Electron. Notes Discret. Math., 2011
Thue choosability of trees.
Discret. Appl. Math., 2011
2010
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most <i>k</i>.
J. Graph Theory, 2010
Binary words avoiding the pattern AABBCABBA.
RAIRO Theor. Informatics Appl., 2010
On maximal repetitions of arbitrary exponent.
Inf. Process. Lett., 2010
Planar Graphs Have 1-string Representations.
Discret. Comput. Geom., 2010
2009
On star and caterpillar arboricity.
Discret. Math., 2009
2008
On the oriented chromatic index of oriented graphs.
J. Graph Theory, 2008
Oriented colorings of partial 2-trees.
Inf. Process. Lett., 2008
On induced-universal graphs for the class of bounded-degree graphs.
Inf. Process. Lett., 2008
Avoiding Approximate Squares.
Int. J. Found. Comput. Sci., 2008
Homomorphisms of 2-edge-colored graphs.
Electron. Notes Discret. Math., 2008
Strong oriented chromatic number of planar graphs without cycles of specific lengths.
Electron. Notes Discret. Math., 2008
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles.
Discret. Math. Theor. Comput. Sci., 2008
2007
Letter frequency in infinite repetition-free words.
Theor. Comput. Sci., 2007
Oriented colorings of 2-outerplanar graphs.
Inf. Process. Lett., 2007
Oriented vertex and arc colorings of partial 2-trees.
Electron. Notes Discret. Math., 2007
On circle graphs with girth at least five.
Electron. Notes Discret. Math., 2007
Dejean's conjecture and letter frequency.
Electron. Notes Discret. Math., 2007
Planar graphs are in 1-STRING.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Avoiding Approximate Squares.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007
2006
On the acyclic choosability of graphs.
J. Graph Theory, 2006
A generator of morphisms for infinite words.
RAIRO Theor. Informatics Appl., 2006
2005
A generalization of repetition threshold.
Theor. Comput. Sci., 2005
On some arboricities in planar graphs.
Electron. Notes Discret. Math., 2005
2004
On the interval number of special graphs.
J. Graph Theory, 2004
Oriented colorings of triangle-free planar graphs.
Inf. Process. Lett., 2004
2003
How Many Square Occurrences Must a Binary Sequence Contain?
Electron. J. Comb., 2003
