Théo Pierron

collaborators

4 papers

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…

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…