Théo Pierron

From MaRDI portal
(Redirected from Person:777376)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
A Brooks-like result for graph powers
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Oriented total-coloring of oriented graphs
Discrete Mathematics
2024-08-19Paper
A note on highly connected \(K_{2, \ell}\)-minor free graphs
Discrete Mathematics
2024-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 graphs
Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Improved pyrotechnics: closer to the burning number conjecture
The Electronic Journal of Combinatorics
2024-02-16Paper
(Sub)linear kernels for edge modification problems towards structured graph classes2024-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 Discharging
SIAM Journal on Discrete Mathematics
2024-01-23Paper
A Brooks-like result for graph powers
European Journal of Combinatorics
2024-01-23Paper
A note on the flip distance between non-crossing spanning trees
(available as arXiv preprint)
2023-12-16Paper
scientific article; zbMATH DE number 7774300 (Why is no real title available?)
(available as arXiv preprint)
2023-12-08Paper
The smallest 5-chromatic tournament
Mathematics of Computation
2023-10-23Paper
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
Journal of Graph Theory
2023-10-10Paper
Extremal independent set reconfiguration
The Electronic Journal of Combinatorics
2023-08-18Paper
Strengthening a Theorem of Meyniel
SIAM Journal on Discrete Mathematics
2023-05-31Paper
Recoloring Planar Graphs of Girth at Least Five
SIAM Journal on Discrete Mathematics
2023-03-30Paper
Improved square coloring of planar graphs
Discrete Mathematics
2023-02-21Paper
scientific article; zbMATH DE number 7650223 (Why is no real title available?)2023-02-03Paper
(Sub)linear kernels for edge modification problems toward structured graph classes
Algorithmica
2022-10-27Paper
Density maximizers of layered permutations
The Electronic Journal of Combinatorics
2022-10-06Paper
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Algorithmica
2022-05-03Paper
Improved square coloring of planar graphs
(available as arXiv preprint)
2021-12-23Paper
Recolouring planar graphs of girth at least five
(available as arXiv preprint)
2021-12-01Paper
On the signed chromatic number of some classes of graphs
Discrete Mathematics
2021-11-23Paper
Graph isomorphism for \((H_1, H_2)\)-free graphs: an almost complete dichotomy
Algorithmica
2021-04-08Paper
Degeneracy and colorings of squares of planar graphs without 4-cycles
Combinatorica
2021-03-20Paper
Pushable chromatic number of graphs with degree constraints
Discrete Mathematics
2021-01-21Paper
Complexity of planar signed graph homomorphisms to cycles
Discrete Applied Mathematics
2020-07-07Paper
Hadwiger meets Cayley2020-05-12Paper
Coloring squares of graphs with mad constraints
Discrete Applied Mathematics
2019-11-27Paper
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
(available as arXiv preprint)
2018-11-29Paper
Rings of invariants for the three-dimensional modular representations of elementary abelian \(p\)-groups of rank four
Involve
2016-07-29Paper
Quantifier alternation for infinite words
Lecture Notes in Computer Science
2016-06-10Paper
A note on highly connected $K_{2,\ell}$-minor free graphs
(available as arXiv preprint)
N/APaper
Fast winning strategies for the attacker in eternal domination
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Théo Pierron