François Pirot

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2025

Vertex-partitions of 2-edge-colored graphs

Jørgen Bang-Jensen, Francois Pirot, Anders Yeo

A {\bf $k$ -majority coloring} of a digraph $D = (V, A)$ is a coloring of $V$ with $k$ colors so that each vertex $v \in V$ has at least as many out-neighbours of color differe…

math.CO2025

New bounds for proper $h$ -conflict-free colourings

Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang +1

A proper $k$ -colouring of a graph $G$ is called $h$ -conflict-free if every vertex $v$ has at least $min {h, deg (v)}$ colours appearing exactly once in its neighbourhood.…

math.CO2022

Acyclic colourings of graphs with obstructions

Quentin Chuet, Johanne Cohen, François Pirot

Given a graph $G$ , a colouring of $G$ is \emph{acyclic} if it is a proper colouring of $G$ and every cycle contains at least three colours. Its acyclic chromatic number $χ_{a} (G)$ is…

Vertex-partitions of 2-edge-colored graphs

New bounds for proper h-conflict-free colourings

Acyclic colourings of graphs with obstructions

New bounds for proper $h$ -conflict-free colourings