Théo Pierron

From MaRDI portal
Person:777376

Available identifiers

zbMath Open pierron.theoMaRDI QIDQ777376

List of research outcomes





PublicationDate of PublicationType
A Brooks-like result for graph powers2024-10-18Paper
Oriented total-coloring of oriented graphs2024-08-19Paper
A note on highly connected \(K_{2, \ell}\)-minor free graphs2024-05-21Paper
Local Certification of Graph Decompositions and Applications to Minor-Free Classes2024-04-15Paper
What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs2024-03-26Paper
Improved pyrotechnics: closer to the burning number conjecture2024-02-16Paper
https://portal.mardi4nfdi.de/entity/Q61924762024-02-12Paper
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters2024-02-12Paper
PACE Solver Description: µSolver - Heuristic Track *2024-02-12Paper
Square Coloring Planar Graphs with Automatic Discharging2024-01-23Paper
A Brooks-like result for graph powers2024-01-23Paper
https://portal.mardi4nfdi.de/entity/Q61793442023-12-16Paper
https://portal.mardi4nfdi.de/entity/Q60834302023-12-08Paper
The smallest 5-chromatic tournament2023-10-23Paper
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable2023-10-10Paper
Extremal independent set reconfiguration2023-08-18Paper
Strengthening a Theorem of Meyniel2023-05-31Paper
Recoloring Planar Graphs of Girth at Least Five2023-03-30Paper
Improved square coloring of planar graphs2023-02-21Paper
https://portal.mardi4nfdi.de/entity/Q58755472023-02-03Paper
(Sub)linear kernels for edge modification problems toward structured graph classes2022-10-27Paper
Density maximizers of layered permutations2022-10-06Paper
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity2022-05-03Paper
Improved square coloring of planar graphs2021-12-23Paper
Recolouring planar graphs of girth at least five2021-12-01Paper
On the signed chromatic number of some classes of graphs2021-11-23Paper
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy2021-04-08Paper
Degeneracy and colorings of squares of planar graphs without 4-cycles2021-03-20Paper
Pushable chromatic number of graphs with degree constraints2021-01-21Paper
Complexity of planar signed graph homomorphisms to cycles2020-07-07Paper
Hadwiger meets Cayley2020-05-12Paper
Coloring squares of graphs with mad constraints2019-11-27Paper
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy2018-11-29Paper
Rings of invariants for the three-dimensional modular representations of elementary abelian \(p\)-groups of rank four2016-07-29Paper
Quantifier alternation for infinite words2016-06-10Paper
A note on highly connected $K_{2,\ell}$-minor free graphsN/APaper
Fast winning strategies for the attacker in eternal dominationN/APaper

Research outcomes over time

This page was built for person: Théo Pierron