Théo Pierron
Masarykova univerzita
H-index: 7
Europe-Czech Republic
Top articles of Théo Pierron
A note on highly connected K2, ℓ-minor free graphs
Discrete Mathematics
2024/7/1
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Square coloring planar graphs with automatic discharging
SIAM Journal on Discrete Mathematics
2024/3/31
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Local certification of forbidden subgraphs
arXiv preprint arXiv:2402.12148
2024/2/19
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Fast winning strategies for the attacker in eternal domination
arXiv preprint arXiv:2401.10584
2024/1/19
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
The smallest 5-chromatic tournament
Mathematics of Computation
2024/1
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
A note on the flip distance between non-crossing spanning trees
arXiv preprint arXiv:2303.07710
2023/3/14
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Extremal Independent Set Reconfiguration
arXiv preprint arXiv:2301.02020
2023/1/5
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
A note on highly connected -minor free graphs
arXiv preprint arXiv:2301.02133
2023/1/5
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Reconfiguration of plane trees in convex geometric graphs
arXiv preprint arXiv:2310.18518
2023/10/27
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Improved pyrotechnics: Closer to the burning number conjecture
The Electronic Journal of Combinatorics
2023/10/6
Every planar graph with Δ Δ⩾ 8 is totally (Δ+ 2) (Δ+2)‐choosable
Journal of Graph Theory
2023/9
Marthe Bonamy
H-Index: 13
Théo Pierron
H-Index: 3
Strengthening a theorem of Meyniel
SIAM Journal on Discrete Mathematics
2023/6/30
Théo Pierron
H-Index: 3
Improved square coloring of planar graphs
Discrete Mathematics
2023/4/1
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Recoloring planar graphs of girth at least five
SIAM Journal on Discrete Mathematics
2023/3/31
(Sub) linear kernels for edge modification problems toward structured graph classes
Algorithmica
2022/11
What can be certified compactly? compact local certification of MSO properties in tree-like graphs
2022/7/20
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity
Algorithmica
2022/5
Hervé Hocquard
H-Index: 8
Théo Pierron
H-Index: 3
PACE Challenge 2021: heuristique pour le cluster editing problem
2022/2/23
What can be certified compactly?
arXiv preprint arXiv:2202.06065
2022/2/12
Nicolas Bousquet
H-Index: 12
Théo Pierron
H-Index: 3
On the signed chromatic number of some classes of graphs
Discrete Mathematics
2022/2/1
