Pascal Ochem

From MaRDI portal
Person:244933

Available identifiers

zbMath Open ochem.pascalMaRDI QIDQ244933

List of research outcomes





PublicationDate of PublicationType
Pseudoperiodic words and a question of Shevelev2024-09-06Paper
Antisquares and critical exponents2024-09-06Paper
Contact graphs of boxes with unidirectional contacts2024-09-06Paper
Critical exponent of binary words with few distinct palindromes2024-07-18Paper
More characterizations of morphic words2023-12-17Paper
Properties of a ternary infinite word2023-05-25Paper
Doubled patterns with reversal and square-free doubled patterns2023-04-19Paper
Complement Avoidance in Binary Words2022-09-20Paper
Acyclic, star, and injective colouring: bounding the diameter2022-06-13Paper
Avoiding square-free words on free groups2022-06-13Paper
Doubled patterns with reversal are 3-avoidable2022-05-20Paper
A family of formulas with reversal of arbitrarily high avoidability index2021-11-18Paper
Homomorphisms of planar \((m,n)\)-colored-mixed graphs to planar targets2021-09-30Paper
Avoiding large squares in trees and planar graphs2021-06-02Paper
Doubled patterns with reversal and square-free doubled patterns2021-05-10Paper
Avoiding Square-Free Words on Free Groups2021-04-14Paper
A family of formulas with reversal of arbitrarily high avoidability index2021-03-13Paper
Avoidability of palindrome patterns2021-01-29Paper
Avoiding conjugacy classes on the 5-letter alphabet2020-07-21Paper
Complexity of planar signed graph homomorphisms to cycles2020-07-07Paper
Partitioning sparse graphs into an independent set and a graph with bounded size components2020-06-08Paper
On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\)2020-05-18Paper
Nice formulas, $xyx$-formulas, and palindrome patterns2020-05-11Paper
Oriented cliques and colorings of graphs with low maximum degree2020-03-20Paper
Some further results on squarefree arithmetic progressions in infinite words2019-11-13Paper
New results on pseudosquare avoidance2019-11-06Paper
Vertex partitions of \((C_3, C_4, C_6)\)-free planar graphs2019-09-11Paper
Repetition avoidance in products of factors2019-09-10Paper
On the Kőnig‐Egerváry theorem for ‐paths2019-06-14Paper
Oriented coloring of graphs with low maximum degree2019-05-29Paper
On some interesting ternary formulas2019-03-05Paper
Avoiding or Limiting Regularities in Words2019-01-24Paper
Oriented incidence colourings of digraphs2018-12-05Paper
On repetition thresholds of caterpillars and trees of bounded degree2018-05-25Paper
Avoidability of circular formulas2018-04-16Paper
On some interesting ternary formulas2017-11-15Paper
Avoidability of formulas with two variables2017-11-10Paper
2-subcoloring is NP-complete for planar comparability graphs2017-09-19Paper
Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs2017-06-30Paper
Oriented, 2-edge-colored, and 2-vertex-colored homomorphisms2017-04-20Paper
The complexity of partitioning into disjoint cliques and a triangle-free graph2017-03-15Paper
Exponential domination in subcubic graphs2017-01-18Paper
Bounds on the exponential domination number2016-12-22Paper
Avoidability of Formulas with Two Variables2016-08-30Paper
A short proof that shuffle squares are 7-avoidable2016-08-12Paper
On interval representations of graphs2016-02-12Paper
Doubled patterns are 3-avoidable2016-02-11Paper
Islands in Graphs on Surfaces2016-02-05Paper
Complexity dichotomy for oriented homomorphism of planar graphs with large girth2015-07-24Paper
The maximum clique problem in multiple interval graphs2015-06-25Paper
Characterization of some binary words with few squares2015-06-11Paper
Near-colorings: non-colorable graphs and NP-completeness2015-03-11Paper
More on Square-free Words Obtained from Prefixes by Permutations2014-12-22Paper
https://portal.mardi4nfdi.de/entity/Q29346442014-12-18Paper
Binary patterns in binary cube-free words: Avoidability and growth2014-12-12Paper
https://portal.mardi4nfdi.de/entity/Q31912652014-10-01Paper
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs2014-09-19Paper
On the number of prime factors of an odd perfect number2014-09-10Paper
Application of entropy compression in pattern avoidance2014-09-04Paper
Strong edge-colouring and induced matchings2014-04-14Paper
Vertex partitions of graphs into cographs and stars2014-01-28Paper
Homomorphisms of signed planar graphs2014-01-14Paper
Bounds and complexity results for strong edge colouring of subcubic graphs2013-11-01Paper
Oriented coloring of triangle-free planar graphs and 2-outerplanar graphs2013-07-23Paper
A Complexity Dichotomy for the Coloring of Sparse Graphs2013-05-21Paper
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)2012-11-06Paper
Locally identifying coloring of graphs2012-10-24Paper
Repetition thresholds for subdivided graphs and trees2012-08-31Paper
Odd perfect numbers are greater than \(10^{1500}\)2012-06-29Paper
Sieve methods for odd perfect numbers2012-06-29Paper
Thue choosability of trees2012-04-30Paper
Bounds for the generalized repetition threshold2011-06-16Paper
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k2010-11-10Paper
On maximal repetitions of arbitrary exponent2010-09-07Paper
Homomorphisms of 2-edge-colored graphs2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35767182010-07-30Paper
Oriented colorings of partial 2-trees2010-06-09Paper
On induced-universal graphs for the class of bounded-degree graphs2010-06-09Paper
Planar graphs have 1-string representations2010-04-12Paper
Binary words avoiding the pattern AABBCABBA2010-03-12Paper
Oriented colorings of 2-outerplanar graphs2010-01-29Paper
Oriented colorings of triangle-free planar graphs2009-08-27Paper
Islands in Graphs on Surfaces2009-06-19Paper
On star and caterpillar arboricity2009-06-19Paper
AVOIDING APPROXIMATE SQUARES2008-11-24Paper
Dejean's conjecture and letter frequency2008-09-25Paper
Oriented vertex and arc colorings of partial 2-trees2008-06-05Paper
On circle graphs with girth at least five2008-06-05Paper
Homomorphisms of 2-edge-colored graphs2008-06-05Paper
Strong oriented chromatic number of planar graphs without cycles of specific lengths2008-06-05Paper
https://portal.mardi4nfdi.de/entity/Q53877262008-05-27Paper
On the oriented chromatic index of oriented graphs2008-05-14Paper
Avoiding Approximate Squares2007-11-28Paper
Letter frequency in infinite repetition-free words2007-07-16Paper
On some arboricities in planar graphs2007-05-29Paper
Dejean's conjecture and letter frequency2007-05-29Paper
A generator of morphisms for infinite words2007-02-08Paper
On the acyclic choosability of graphs2006-05-16Paper
A generalization of repetition threshold2005-12-06Paper
A generalization of repetition threshold2005-08-22Paper
On the interval number of special graphs2004-08-16Paper
How many square occurrences must a binary sequence contain?2003-05-07Paper
Contact graphs of boxes with unidirectional contactsN/APaper
Critical exponent of binary words with few distinct palindromesN/APaper
Antisquares and Critical ExponentsN/APaper
Pseudoperiodic Words and a Question of ShevelevN/APaper

Research outcomes over time

This page was built for person: Pascal Ochem