Pascal Ochem
- Near-colorings: non-colorable graphs and NP-completeness
2013/06/04 by Mickaël Montassier, Montassier, Mickael, Pascal Ochem +1 · 2 citations
Computer Science · #Advanced Graph Theory Research #Graph Labeling and Dimension Problems
- Critical exponent of binary words with few distinct palindromes
2023/11/21 by Ľubomíra Dvořáková, Pascal Ochem, Dvořáková, L'ubomíra +3 · 4 citations
Computer Science · Mathematics · #semigroups and automata theory #Advanced Combinatorial Mathematics #Algebraic structures and combinatorial models
- Properties of a Ternary Infinite Word
2022/06/03 by James D. Currie, Pascal Ochem, Currie, James +5 · 3 citations
Computer Science · #Advanced Algebra and Logic #Coding theory and cryptography #Combinatorics (math.CO) #Discrete Mathematics (cs.DM) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #Formal Languages and Automata Theory (cs.FL) #semigroups and automata theory
- 2-subcoloring is NP-complete for planar comparability graphs
2017/02/04 by Pascal Ochem, Ochem, Pascal · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Graph Labeling and Dimension Problems
- Complement Avoidance in Binary Words
2022/09/20 by James D. Currie, Currie, James, Dvořaková, L'ubomíra +7 · 1 citation
Computer Science · #semigroups and automata theory #Computability, Logic, AI Algorithms #Advanced Algebra and Logic
- On odd perfect numbers with exactly one even exponent greater than 2
2026/07/22 by Pascal Ochem, Joshua Zelinsky
#math.GM