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

Showing 2019Show all

4 papers · 1 filter

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…

A Brooks-like result for graph powers

Pushable chromatic number of graphs with degree constraints

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

Coloring squares of graphs with mad constraints

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