Théo Pierron

activity

20182026

most citedImproved pyrotechnics : Closer to the burning graph conjecture

1 citations · 2 across the 6 of their papers we have counts for

collaborators

10 papers

math.CO2026

Inversion diameter and 2-edge-colored homomorphisms

Carmen Arana, Thomas Bellitto, Hector Buffière +3

In an oriented graph, the inversion of a subset of vertices X is the operation reversing the direction of every arc with both endpoints in X. Given a graph G, the inversion distanc…

math.CO2025

Chromatic discrepancy of locally $s$ -colourable graphs

Timothée Corsini, Lucas Picasarri-Arrieta, Théo Pierron +2

The chromatic discrepancy of a graph $G$ , denoted $ϕ (G)$ , is the least over all proper colourings $σ$ of $G$ of the greatest difference between the number of colours $∣ σ (V (H)) ∣$ sp…

math.CO2025

Determining a graph from its reconfiguration graph

Gaétan Berthe, Caroline Brosse, Brian Hearn +3

Given a graph $G$ and a natural number $k$ , the $k$ -recolouring graph $C_{k} (G)$ is the graph whose vertices are the $k$ -colourings of $G$ and whose edges link pairs of col…

math.CO2021★ 1 cited

Improved pyrotechnics : Closer to the burning graph conjecture

Paul Bastide, Marthe Bonamy, Anthony Bonato +4

The Burning Number Conjecture claims that for every connected graph $G$ of order $n,$ its burning number satisfies $b (G) \leq ⌈ n ⌉ .$ While the conjecture remains o…

cs.DM2020

On the signed chromatic number of some classes of graphs

Julien Bensmail, Sandip Das, Soumen Nandi +3

A signed graph $(G, σ)$ is a graph $G$ along with a function $σ : E (G) \to {+, -}$ . A closed walk of a signed graph is positive (resp., negative) if it has an even (resp., odd) num…

cs.DM2019

A Brooks-like result for graph powers

Théo Pierron

Coloring a graph $G$ consists in finding an assignment of colors $c : V (G) \to {1, \dots, p}$ such that any pair of adjacent vertices receives different colors. The minimum integer $…

cs.DM2019

Pushable chromatic number of graphs with degree constraints

Julien Bensmail, Sandip Das, Soumen Nandi +4

Pushable homomorphisms and the pushable chromatic number $χ_{p}$ of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any orie…

cs.DM2019★ 1 cited

Every planar graph with $Δ ⩾ 8$ is totally $(Δ + 2)$ -choosable

Marthe Bonamy, Théo Pierron, Éric Sopena

Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally $k$ -choosable if for any list assignment of $k$ colors to each vert…

math.CO2019

Coloring squares of graphs with mad constraints

Hervé Hocquard, Seog-Jin Kim, Théo Pierron

A proper vertex $k$ -coloring of a graph $G = (V, E)$ is an assignment $c : V \to {1, 2, \dots, k}$ of colors to the vertices of the graph such that no two adjacent vertices are associate…

math.CO2018

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles

Ilkyoo Choi, Daniel W. Cranston, Théo Pierron

We prove several results on coloring squares of planar graphs without 4-cycles. First, we show that if $G$ is such a graph, then $G^{2}$ is $(Δ (G) + 72)$ -degenerate. This implies an up…