Théo Pierron

According to our database1, Théo Pierron authored at least 9 papers between 2016 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Complexity of planar signed graph homomorphisms to cycles.
Discret. Appl. Math., 2020

On the signed chromatic number of some classes of graphs.
CoRR, 2020

2019
Induction Schemes : From Language Separation to Graph Colorings. (Schémas d'induction : from languages separation to graph colorings).
PhD thesis, 2019

Coloring squares of graphs with mad constraints.
Discret. Appl. Math., 2019

A Brooks-like result for graph powers.
CoRR, 2019

Pushable chromatic number of graphs with degree constraints.
CoRR, 2019

Every planar graph with Δ≥8 is totally (Δ+2)-choosable.
CoRR, 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2016
Quantifier Alternation for Infinite Words.
Proceedings of the Foundations of Software Science and Computation Structures, 2016


  Loading...